Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection

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.

[2]  Bernd Bischl,et al.  ASlib: A benchmark library for algorithm selection , 2015, Artif. Intell..

[3]  Heike Trautmann,et al.  Leveraging TSP Solver Complementarity through Machine Learning , 2018, Evolutionary Computation.

[4]  Keld Helsgaun,et al.  General k-opt submoves for the Lin–Kernighan TSP heuristic , 2009, Math. Program. Comput..

[5]  Heike Trautmann,et al.  Improving the State of the Art in Inexact TSP Solving Using Per-Instance Algorithm Selection , 2015, LION.

[6]  J. Lenstra,et al.  In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation , 2016 .

[7]  Recherche Opérationnelle,et al.  REVUE FRANÇAISE D'AUTOMATIQUE, D'INFORMATIQUE ET DE , 1985 .

[8]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[9]  Shigenobu Kobayashi,et al.  A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem , 2013, INFORMS J. Comput..

[10]  Thomas Stützle,et al.  Automatically improving the anytime behaviour of optimisation algorithms , 2014, Eur. J. Oper. Res..

[11]  Thomas Stützle,et al.  Stochastic Local Search , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[12]  Markus Wagner,et al.  Evolving diverse TSP instances by means of novel and creative mutation operators , 2019, FOGA '19.

[13]  Heike Trautmann,et al.  Automated Algorithm Selection: Survey and Perspectives , 2018, Evolutionary Computation.

[14]  Xiaolei Ma,et al.  Vehicle Routing Problem , 2013 .

[15]  Günter Rudolph,et al.  Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic Routing of a Vehicle , 2015, GECCO.

[16]  L. Darrell Whitley,et al.  Building a better heuristic for the traveling salesman problem: combining edge assembly crossover and partition crossover , 2017, GECCO.

[17]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[18]  Heike Trautmann,et al.  A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms , 2020, Appl. Soft Comput..

[19]  Gabriela Ochoa,et al.  Rigorous Performance Analysis of State-of-the-Art TSP Heuristic Solvers , 2019, EvoCOP.

[20]  Anne Auger,et al.  COCO: a platform for comparing continuous optimizers in a black-box setting , 2016, Optim. Methods Softw..

[21]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[22]  Joseph S. B. Mitchell,et al.  Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..

[23]  Kevin Leyton-Brown,et al.  Algorithm runtime prediction: Methods & evaluation , 2012, Artif. Intell..

[24]  Bernd Bischl,et al.  A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem , 2012, Annals of Mathematics and Artificial Intelligence.