The travelling salesman problem (TSP) is defined as follows, “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?”. Increasing the number of cities increases the number of possible routes enormously which makes this…