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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2007)
Helsgaun, K.: Effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106–130 (2000)
Helsgaun, K.: An effective implementation of k-opt moves for the Lin-Kernighan TSP heuristic. Technical report 109, Roskilde University (2007)
Nagata, Y., Kobayashi, S.: A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem. INFORMS J. Comput. 25(2), 346–363 (2013)
Whitley, D., Hains, D., Howe, A.: A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 566–575. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15844-5_57
Corne, D.W., Reynolds, A.P.: Optimisation and generalisation: footprints in instance space. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 22–31. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15844-5_3
Smith-Miles, K., Lopes, L.: Measuring instance difficulty for combinatorial optimization problems. Comput. Oper. Res. 39(5), 875–889 (2012)
Pihera, J., Musliu, N.: Application of machine learning to algorithm selection for TSP. In: IEEE 26th International Conference on Tools with Artificial Intelligence, pp. 47–54 (2014)
Kotthoff, L., Kerschke, P., Hoos, H., Trautmann, H.: Improving the state of the art in inexact TSP solving using per-instance algorithm selection. In: Dhaenens, C., Jourdan, L., Marmion, M.-E. (eds.) LION 2015. LNCS, vol. 8994, pp. 202–217. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-19084-6_18
Kerschke, P., Kotthoff, L., Bossek, J., Hoos, H.H.: Leveraging TSP solver complementarity through machine learning. Evol. Comput. 26(4), 597–620 (2018)
Bossek, J.: netgen: Network Generator for Combinatorial Graph Problems (2016). https://CRAN.R-project.org/package=netgen, R package version 1.3
R Core Team: R: A language and environment for statistical computing, Vienna (2018). https://www.R-project.org/
Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., Neumann, F.: A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem. Ann. Math. Artif. Intell. 69(2), 151–182 (2013)
Reinelt, G.: TSPLIB - a traveling salesman problem library. ORSA J. Comput. 3(4), 376–384 (1991)
Rohe, A.: VLSI data sets (2017). http://www.math.uwaterloo.ca/tsp/vlsi/. Accessed 5 Nov 2018
Tinós, R., Helsgaun, K., Whitley, D.: Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic. In: Auger, A., Fonseca, C.M., Lourenço, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11101, pp. 95–107. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-99253-2_8
Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21, 498–516 (1973)
Nagata, Y., Kobayashi, S.: Edge assembly crossover: a high-power genetic algorithm for the travelling salesman problem. In: ICGA, pp. 450–457 (1997)
Applegate, D., Bixby, R., Chvátal, V., Cook, W.: Concorde TSP solver (2003). http://www.math.uwaterloo.ca/tsp/concorde.html
Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67–82 (1997)
Bischl, B., Mersmann, O., Trautmann, H., PreuĂź, M.: Algorithm selection based on exploratory landscape analysis and cost-sensitive learning, p. 313 (2012)
Acknowledgements
This work was supported by the Leverhulme Trust [award number RPG-2015-395] and by the UK’s Engineering and Physical Sciences Research Council [grant number EP/J017515/1]. Results were obtained using the EPSRC-funded ARCHIE-WeSt High Performance Computer (www.archie-west.ac.uk, EPSRC grant EP/K000586/1).
Data Access. All data generated for this research are openly available from the Stirling Online Repository for Research Data (http://hdl.handle.net/11667/127).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
McMenemy, P., Veerapen, N., Adair, J., Ochoa, G. (2019). Rigorous Performance Analysis of State-of-the-Art TSP Heuristic Solvers. In: Liefooghe, A., Paquete, L. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2019. Lecture Notes in Computer Science(), vol 11452. Springer, Cham. https://doi.org/10.1007/978-3-030-16711-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-16711-0_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-16710-3
Online ISBN: 978-3-030-16711-0
eBook Packages: Computer ScienceComputer Science (R0)