Abstract
In its classical version, the Traveling Salesman Problem (TSP ) can be described as follows: givena set of cities and knowing the distance between each of these cities, it is necessary to find the shortest possible route such that each city is visited only once, including the city of origin, where the route also ends. In other words, the objective is to find the circuit with the shortest …