A problem solving the problem that salesmen who move in several cities can move all cities most efficiently (with minimum movement cost)Traveling salesman problemAlthough it is called, a movie ...

The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...