Keywords : TSP


Computing the shortest route amongmultiple points without revealing theirgeographical locations

Ayad Ibrahim Abdulsada Ali Hussein Rason Ali A. Yassin

Journal of Al-Qadisiyah for Computer Science and Mathematics, 2015, Volume 7, Issue 1, Pages 28-40

Travelling salesman problem (TSP) represents a classical optimization problem.
Its main goal is to find the shortest route when visiting multiple points.
However, the state of the art methods are generally assumed that the
geographical locations are not private. This reduces the utilization of these
methods to work within public environments. Essentially, this assumption limits
more practical applications, e.g., the shortest route among military bases, where
the geographical locations of such bases are confidential. This paper presents a
method for privately computing the shortest route among multiple points on the
Earth without compromising the privacy of their locations.