Advertisement

Improving the State of the Art in Inexact TSP Solving Using Per-Instance Algorithm Selection

  • Lars Kotthoff
  • Pascal Kerschke
  • Holger Hoos
  • Heike Trautmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8994)

Abstract

We investigate per-instance algorithm selection techniques for solving the Travelling Salesman Problem (TSP), based on the two state-of-the-art inexact TSP solvers, LKH and EAX. Our comprehensive experiments demonstrate that the solvers exhibit complementary performance across a diverse set of instances, and the potential for improving the state of the art by selecting between them is significant. Using TSP features from the literature as well as a set of novel features, we show that we can capitalise on this potential by building an efficient selector that achieves significant performance improvements in practice. Our selectors represent a significant improvement in the state-of-the-art in inexact TSP solving, and hence in the ability to find optimal solutions (without proof of optimality) for challenging TSP instances in practice.

Keywords

Random Forest Algorithm Selection Travel Salesman Problem Multivariate Adaptive Regression Spline Feature Computation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgements

We thank Thomas Stützle for letting us use the restart version of LKH 1.3 he implemented in the context of a different project and for helpful comments on earlier versions of this work. Holger Hoos acknowledges support from an NSERC Discovery Grant. Lars Kotthoff is supported by EU FP7 FET project 284715 (ICON) and an IRC “New Foundations” grant. Pascal Kerschke and Heike Trautmann acknowledge support from the European Center of Information Systems (ERCIS).

References

  1. 1.
    Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2007)Google Scholar
  2. 2.
    Bischl, B., Mersmann, O., Trautmann, H., Preuss, M.: Algorithm selection based on exploratory landscape analysis and cost-sensitive learning. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, GECCO 2012. ACM, New York (2012)Google Scholar
  3. 3.
    Gomes, C.P., Selman, B.: Algorithm portfolios. Artif. Intell. 126(1–2), 43–62 (2001)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Helsgaun, K.: General k-opt submoves for the LinKernighan TSP heuristic. Math. Program. Comput. 1(2–3), 119–163 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science 275(5296), 51–54 (1997)CrossRefGoogle Scholar
  6. 6.
    Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction: methods and evaluation. Artif. Intell. 206, 79–111 (2014)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Kotthoff, L.: LLAMA: leveraging learning to automatically manage algorithms. Technical report, June 2013. arXiv:1306.1031
  8. 8.
    Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. AI Mag. 35(3), 48–60 (2014)Google Scholar
  9. 9.
    Lacoste, J.D., Hoos, H.H., Stützle, T.: On the empirical time complexity of state-of-the-art inexact tsp solvers. (manuscript in preparation)Google Scholar
  10. 10.
    Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm portfolios based on cost-sensitive hierarchical clustering. In: IJCAI, August 2013Google Scholar
  11. 11.
    Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C., Rudolph, G.: Exploratory landscape analysis. In: Proceedings of the 13th Annual Conference on Genetic and Vvolutionary Computation, GECCO 2011, pp. 829–836. ACM, New York (2011). http://doi.acm.org/10.1145/2001576.2001690
  12. 12.
    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)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    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)CrossRefMathSciNetGoogle Scholar
  14. 14.
    O’Mahony, E., Hebrard, E., Holland, A., Nugent, C., O’Sullivan, B.: Using case-based reasoning in an algorithm portfolio for constraint solving. In: Proceedings of the 19th Irish Conference on Artificial Intelligence and Cognitive Science, January 2008Google Scholar
  15. 15.
    Pihera, J., Musliu, N.: Application of machine learning to algorithm selection for TSP. In: Fogel, D., et al. (eds.) Proceedings of the IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE press (2014)Google Scholar
  16. 16.
    Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65–118 (1976)Google Scholar
  17. 17.
    Roussel, O.: Controlling a solver execution with the runsolver tool. JSAT 7(4), 139–144 (2011)MathSciNetGoogle Scholar
  18. 18.
    Seipp, J., Braun, M., Garimort, J., Helmert, M.: Learning portfolios of automatically tuned planners. In: ICAPS (2012)Google Scholar
  19. 19.
    Smith-Miles, K., van Hemert, J.: Discovering the suitability of optimisation algorithms by learning from evolved instances. Ann. Math. Artif. Intell. 61(2), 87–104 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  20. 20.
    Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. (JAIR) 32, 565–606 (2008)zbMATHGoogle Scholar
  21. 21.
    Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Hydra-MIP: automated algorithm configuration and selection for mixed integer programming. In: RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion at the International Joint Conference on Artificial Intelligence (IJCAI), pp. 16–30 (2011)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Lars Kotthoff
    • 1
  • Pascal Kerschke
    • 2
  • Holger Hoos
    • 3
  • Heike Trautmann
    • 2
  1. 1.Insight Centre for Data AnalyticsCorkIreland
  2. 2.University of MünsterMünsterGermany
  3. 3.University of British ColumbiaVancouverCanada

Personalised recommendations