The Travelling Salesman Problem $($TSP$)$ is$,$ again, a classic NP$-$hard problem in optimization, and

is commonly stated as: "Given a list of cities and the distances between each pair of cities, what is the shortest

possible route that visits each city?"