Computing the shortest route among multiple points without revealing their geographical locations

Abstract EN

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.