Rigorous Performance Analysis of State-of-the-Art TSP Heuristic Solvers

Abstract : Understanding why some problems are better solved by one algorithm rather than another is still an open problem, and the symmetric Travelling Salesperson Problem (TSP) is no exception. We apply three state-of-the-art heuristic solvers to a large set of TSP instances of varying structure and size, identifying which heuristics solve specific instances to optimality faster than others. The first two solvers considered are variants of the multi-trial Helsgaun’s Lin-Kernighan Heuristic (a form of iterated local search), with each utilising a different form of Partition Crossover; the third solver is a genetic algorithm (GA) using Edge Assembly Crossover. Our results show that the GA with Edge Assembly Crossover is the best solver, shown to significantly outperform the other algorithms in 73% of the instances analysed. A comprehensive set of features for all instances is also extracted, and decision trees are used to identify main features which could best inform algorithm selection. The most prominent features identified a high proportion of instances where the GA with Edge Assembly Crossover performed significantly better when solving to optimality.
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

Contributor : Nadarajen Veerapen <>
Submitted on : Thursday, April 25, 2019 - 11:23:18 PM
Last modification on : Tuesday, May 28, 2019 - 2:31:35 PM


Files produced by the author(s)




Paul Mcmenemy, Nadarajen Veerapen, Jason Adair, Gabriela Ochoa. Rigorous Performance Analysis of State-of-the-Art TSP Heuristic Solvers. European Conference on Evolutionary Computation in Combinatorial Optimization, Apr 2019, Leipzig, Germany. pp.99-114, ⟨10.1007/978-3-030-16711-0_7⟩. ⟨hal-02095416⟩



Record views


Files downloads