On the empirical scaling of running time for finding optimal solutions to the TSP
We study the empirical scaling of the running time required by state-of-the-art exact and inexact TSP algorithms for finding optimal solutions to Euclidean TSP instances as a function of instance size. In particular, we use a recently introduced statistical approach to obtain scaling models from observed performance data and to assess the accuracy of these models. For Concorde, the long-standing state-of-the-art exact TSP solver, we compare the scaling of the running time until an optimal solution is first encountered (the finding time) and that of the overall running time, which adds to the finding time the additional time needed to complete the proof of optimality. For two state-of-the-art inexact TSP solvers, LKH and EAX, we compare the scaling of their running time for finding an optimal solution to a given instance; we also compare the resulting models to that for the scaling of Concorde’s finding time, presenting evidence that both inexact TSP solvers show significantly better scaling behaviour than Concorde.
KeywordsTraveling salesman problem Lin-Kernighan algorithm Evolutionary algorithms Scaling analysis Concorde Empirical analysis
This work received support from the COMEX project within the Interuniversity Attraction Poles Programme of the Belgian Science Policy Office. Thomas Stützle acknowledges support from the Belgian F.R.S.-FNRS, of which he is a research director. Holger Hoos acknowledges support through an NSERC Discovery Grant and a computing resource allocation by Compute Canada / Calcul Canada.
- Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The traveling salesman problem, Concorde TSP solver. (2012) http://www.tsp.gatech.edu/concorde
- Dubois-Lacoste, J., Hoos, H.H., Stützle, T.: On the empirical scaling behaviour of state-of-the-art local search algorithms for the Euclidean TSP. In: Proceedings of GECCO 2015, pp. 377–384 (2015)Google Scholar
- Hoos, H.H.: A bootstrap approach to analysing the scaling of empirical run-time data with problem size. Tech. rep., TR-2009-16, Department of Computer Science, University of British Columbia (2009)Google Scholar
- Kotthoff, L., Kerschke, P., Hoos, H., Trautmann, H.: Improving the state of the art in inexact TSP solving using per-instance algorithm selection. In: Proceedings of LION 2015, Lecture Notes in Computer Science, vol. 8994, pp. 202–217. Springer, Heidelberg, Germany (2015)Google Scholar
- Mu, Z., Hoos, H.H.: Empirical scaling analyser: An automated system for empirical analysis of performance scaling. In: Proceedings of GECCO 2015, Companion, pp. 771–772 (2015)Google Scholar
- Mu, Z., Hoos, H.H.: On the empirical time complexity of random 3-SAT at the phase transition. In: Proceedings of IJCAI 2015, pp. 367–373 (2015)Google Scholar
- Mu, Z., Hoos, H.H., Stützle, T.: The impact of automated algorithm configuration on the scaling behaviour of state-of-the-art inexact TSP solvers. In: Proceedings of LION 10, Lecture Notes in Computer Science, vol. 10079, pp. 157–172. Springer, Heidelberg, Germany (2016)Google Scholar
- Mu, Z., Dubois-Lacoste, J., Hoos, H.H., Stützle, T.: On the empirical scaling of running time for finding optimal solutions to the TSP: Supplementary material. (2017). http://iridia.ulb.ac.be/supp/IridiaSupp2017-010/
- Stützle, T., Hoos, H.H.: Analysing the run-time behaviour of iterated local search for the travelling salesman problem. In: Hansen, P., Ribeiro, C. (eds.) Essays and Surveys on Metaheuristics, pp. 589–611. Kluwer Academic Publishers, Dordrecht (2001)Google Scholar