The travelling salesman problem 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 and returns to the origin city?” In the following post, the cities are represented by coordinates on a Cartesian plane. The distance (Euclidean distance) […]