A few words about the Travelling Salesman Problem

Travelling Salesman Problem

The travelling salesman problem (TSP) asks the following question: “Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?” It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.

TSP is a special case of the travelling purchaser problem and the vehicle routing problem.

Special case of the TSP is a finding shortest path for UAVs.

Leave a Reply

Your email address will not be published. Required fields are marked *