Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection
J. Bossek, P. Kerschke, H. Trautmann, in: Proceedings of the IEEE Congress on Evolutionary Computation (CEC), IEEE, Glasgow, UK, 2020, pp. 1–8.
Download
No fulltext has been uploaded.
Conference Paper
| English
Author
Abstract
The Traveling-Salesperson-Problem (TSP) is arguably one of the best-known NP-hard combinatorial optimization problems. The two sophisticated heuristic solvers LKH and EAX and respective (restart) variants manage to calculate close-to optimal or even optimal solutions, also for large instances with several thousand nodes in reasonable time. In this work we extend existing benchmarking studies by addressing anytime behaviour of inexact TSP solvers based on empirical runtime distributions leading to an increased understanding of solver behaviour and the respective relation to problem hardness. It turns out that performance ranking of solvers is highly dependent on the focused approximation quality. Insights on intersection points of performances offer huge potential for the construction of hybridized solvers depending on instance features. Moreover, instance features tailored to anytime performance and corresponding performance indicators will highly improve automated algorithm selection models by including comprehensive information on solver quality.
Publishing Year
Proceedings Title
Proceedings of the IEEE Congress on Evolutionary Computation (CEC)
Page
1–8
LibreCat-ID
Cite this
Bossek J, Kerschke P, Trautmann H. Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC). IEEE; 2020:1–8.
Bossek, J., Kerschke, P., & Trautmann, H. (2020). Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection. Proceedings of the IEEE Congress on Evolutionary Computation (CEC), 1–8.
@inproceedings{Bossek_Kerschke_Trautmann_2020, place={Glasgow, UK}, title={Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection}, booktitle={Proceedings of the IEEE Congress on Evolutionary Computation (CEC)}, publisher={IEEE}, author={Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}, year={2020}, pages={1–8} }
Bossek, Jakob, Pascal Kerschke, and Heike Trautmann. “Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection.” In Proceedings of the IEEE Congress on Evolutionary Computation (CEC), 1–8. Glasgow, UK: IEEE, 2020.
J. Bossek, P. Kerschke, and H. Trautmann, “Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC), 2020, pp. 1–8.
Bossek, Jakob, et al. “Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection.” Proceedings of the IEEE Congress on Evolutionary Computation (CEC), IEEE, 2020, pp. 1–8.
Google Scholar