---
_id: '46376'
abstract:
- lang: eng
  text: 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.
author:
- first_name: Lars
  full_name: Kotthoff, Lars
  last_name: Kotthoff
- first_name: Pascal
  full_name: Kerschke, Pascal
  last_name: Kerschke
- first_name: Holger
  full_name: Hoos, Holger
  last_name: Hoos
- first_name: Heike
  full_name: Trautmann, Heike
  id: '100740'
  last_name: Trautmann
  orcid: 0000-0002-9788-8282
citation:
  ama: 'Kotthoff L, Kerschke P, Hoos H, Trautmann H. Improving the State of the Art
    in Inexact TSP Solving Using Per-Instance Algorithm Selection. In: Dhaenens C,
    Jourdan L, Marmion M-E, eds. <i>Learning and Intelligent Optimization</i>. Springer
    International Publishing; 2015:202–217.'
  apa: Kotthoff, L., Kerschke, P., Hoos, H., &#38; Trautmann, H. (2015). Improving
    the State of the Art in Inexact TSP Solving Using Per-Instance Algorithm Selection.
    In C. Dhaenens, L. Jourdan, &#38; M.-E. Marmion (Eds.), <i>Learning and Intelligent
    Optimization</i> (pp. 202–217). Springer International Publishing.
  bibtex: '@inproceedings{Kotthoff_Kerschke_Hoos_Trautmann_2015, place={Cham}, title={Improving
    the State of the Art in Inexact TSP Solving Using Per-Instance Algorithm Selection},
    booktitle={Learning and Intelligent Optimization}, publisher={Springer International
    Publishing}, author={Kotthoff, Lars and Kerschke, Pascal and Hoos, Holger and
    Trautmann, Heike}, editor={Dhaenens, Clarisse and Jourdan, Laetitia and Marmion,
    Marie-Eléonore}, year={2015}, pages={202–217} }'
  chicago: 'Kotthoff, Lars, Pascal Kerschke, Holger Hoos, and Heike Trautmann. “Improving
    the State of the Art in Inexact TSP Solving Using Per-Instance Algorithm Selection.”
    In <i>Learning and Intelligent Optimization</i>, edited by Clarisse Dhaenens,
    Laetitia Jourdan, and Marie-Eléonore Marmion, 202–217. Cham: Springer International
    Publishing, 2015.'
  ieee: L. Kotthoff, P. Kerschke, H. Hoos, and H. Trautmann, “Improving the State
    of the Art in Inexact TSP Solving Using Per-Instance Algorithm Selection,” in
    <i>Learning and Intelligent Optimization</i>, 2015, pp. 202–217.
  mla: Kotthoff, Lars, et al. “Improving the State of the Art in Inexact TSP Solving
    Using Per-Instance Algorithm Selection.” <i>Learning and Intelligent Optimization</i>,
    edited by Clarisse Dhaenens et al., Springer International Publishing, 2015, pp.
    202–217.
  short: 'L. Kotthoff, P. Kerschke, H. Hoos, H. Trautmann, in: C. Dhaenens, L. Jourdan,
    M.-E. Marmion (Eds.), Learning and Intelligent Optimization, Springer International
    Publishing, Cham, 2015, pp. 202–217.'
date_created: 2023-08-04T15:24:20Z
date_updated: 2023-10-16T13:41:54Z
department:
- _id: '34'
- _id: '819'
editor:
- first_name: Clarisse
  full_name: Dhaenens, Clarisse
  last_name: Dhaenens
- first_name: Laetitia
  full_name: Jourdan, Laetitia
  last_name: Jourdan
- first_name: Marie-Eléonore
  full_name: Marmion, Marie-Eléonore
  last_name: Marmion
language:
- iso: eng
page: 202–217
place: Cham
publication: Learning and Intelligent Optimization
publication_identifier:
  isbn:
  - 978-3-319-19084-6
publisher: Springer International Publishing
status: public
title: Improving the State of the Art in Inexact TSP Solving Using Per-Instance Algorithm
  Selection
type: conference
user_id: '15504'
year: '2015'
...
