The Mexican Magical Towns Traveling Salesman Problem: Preliminary Results

The Traveling Salesman Problem (TSP) is a classical NPhard combinatorial problem that has been intensively studied through several decades. A large amount of literature is dedicated to this problem. TSP can be directly applied to some real life problems, and to be generalized to some other set of important combinatorial problems. Nowadays, a large collection of TSP instances can be found such as TSPLIB and National TSP webpage, among others. In this paper we experiment with a different TSP instance, that is, a set of 111 Mexican towns (called Magical Towns), by applying five different algorithms: (1) Ant Colony Optimization, (2) Particle Swarm Optimization, (3) Greedy Metaheuristic (4) Lin-Kernighan and (5) Hybrid Metaheuristic. The best results were obtained by the hybrid metaheuristic, with a final cost function of 120.65.