Comparison between Golden Ball Meta-heuristic, Evolutionary Simulated Annealing and Tabu Search for the Traveling Salesman Problem

The Golden Ball is a multi-population meta-heuristic based on soccer concepts. It was first designed to solve combinatorial optimization problems. Until now, it has been tested with different kind of problems, but its efficiency has only been compared with some classical algorithms, such as different kind of Genetic Algorithms and Distributed Genetic Algorithms. In this work, the performance of the Golden Ball is compared with the ones obtained by two famous and widely used techniques: an Evolutionary Simulated Annealing and a Tabu Search. These both meta heuristics are two of the most used ones along the history for solving optimization problems. In this first study, the comparison is performed for the well-known Traveling Salesman Problem.