Abstract
The Traveling Salesman Problem (TSP), in which there is a set of cities and we want to know the circuit with minimum length that traverses each of them exactly once, is of central importance in the field of combinatorial optimization and has a lot of applications in many areas, such as: planning, logistics and microchips manufacture. In this project, we are interested in both the problem'…