@article{kerschke_leveraging_2018,
  title = {Leveraging {TSP} {Solver} {Complementarity} through {Machine} {Learning}},
  volume = {26},
  url = {https://doi.org/10.1162/evco_a_00215},
  doi = {10.1162/evco_a_00215},
  abstract = {The Travelling Salesperson Problem (TSP) is one of the best-studied NP-hard problems. Over the years, many different solution approaches and solvers have been developed. For the first time, we directly compare five state-of-the-art inexact solvers—namely, LKH, EAX, restart variants of those, and MAOS—on a large set of well-known benchmark instances and demonstrate complementary performance, in that different instances may be solved most effectively by different algorithms. We leverage this complementarity to build an algorithm selector, which selects the best TSP solver on a per-instance basis and thus achieves significantly improved performance compared to the single best solver, representing an advance in the state of the art in solving the Euclidean TSP. Our in-depth analysis of the selectors provides insight into what drives this performance improvement.},
  number = {4},
  journal = {Evolutionary Computation},
  author = {Kerschke, Pascal and Kotthoff, Lars and Bossek, Jakob and Hoos, Holger H. and Trautmann, Heike},
  year = {2018},
  pages = {597--620}
}