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

Abstract - 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 metaheuristics 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.

 

↓ Download the Report here ↓

News & Events

TIMON project at the VIII Congreso ITS Euskadi TIMON project at the VIII Congreso ITS Euskadi Tuesday, 21 November 2017 On Friday 10th November, members of the University of Deusto attended the VIII... More detail
TIMON Consortium meeting in Budapest TIMON Consortium meeting in Budapest Thursday, 16 November 2017 The TIMON project partners are meeting on 15-16 November in Budapest (Hungary)... More detail
Read the Second Edition of the TIMON Newsletter! Friday, 03 November 2017 The TIMON consortium is pleased to announce the release of the second TIMON More detail



“The TIMON project has received funding from the European Union's Horizon 2020 research and innovation programme under Grant Agreement No. 636220”

We're on Social Networks. Follow us & get in touch.