Skip to main content
Journal cover image

A case study of algorithm selection for the traveling thief problem

Publication ,  Journal Article
Wagner, M; Lindauer, M; Mısır, M; Nallaperuma, S; Hutter, F
Published in: Journal of Heuristics
June 1, 2018

Many real-world problems are composed of several interacting components. In order to facilitate research on such interactions, the Traveling Thief Problem (TTP) was created in 2013 as the combination of two well-understood combinatorial optimization problems. With this article, we contribute in four ways. First, we create a comprehensive dataset that comprises the performance data of 21 TTP algorithms on the full original set of 9720 TTP instances. Second, we define 55 characteristics for all TPP instances that can be used to select the best algorithm on a per-instance basis. Third, we use these algorithms and features to construct the first algorithm portfolios for TTP, clearly outperforming the single best algorithm. Finally, we study which algorithms contribute most to this portfolio.

Duke Scholars

Published In

Journal of Heuristics

DOI

EISSN

1572-9397

ISSN

1381-1231

Publication Date

June 1, 2018

Volume

24

Issue

3

Start / End Page

295 / 320

Related Subject Headings

  • Operations Research
  • 4901 Applied mathematics
  • 4602 Artificial intelligence
  • 0802 Computation Theory and Mathematics
  • 0801 Artificial Intelligence and Image Processing
  • 0102 Applied Mathematics
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Wagner, M., Lindauer, M., Mısır, M., Nallaperuma, S., & Hutter, F. (2018). A case study of algorithm selection for the traveling thief problem. Journal of Heuristics, 24(3), 295–320. https://doi.org/10.1007/s10732-017-9328-y
Wagner, M., M. Lindauer, M. Mısır, S. Nallaperuma, and F. Hutter. “A case study of algorithm selection for the traveling thief problem.” Journal of Heuristics 24, no. 3 (June 1, 2018): 295–320. https://doi.org/10.1007/s10732-017-9328-y.
Wagner M, Lindauer M, Mısır M, Nallaperuma S, Hutter F. A case study of algorithm selection for the traveling thief problem. Journal of Heuristics. 2018 Jun 1;24(3):295–320.
Wagner, M., et al. “A case study of algorithm selection for the traveling thief problem.” Journal of Heuristics, vol. 24, no. 3, June 2018, pp. 295–320. Scopus, doi:10.1007/s10732-017-9328-y.
Wagner M, Lindauer M, Mısır M, Nallaperuma S, Hutter F. A case study of algorithm selection for the traveling thief problem. Journal of Heuristics. 2018 Jun 1;24(3):295–320.
Journal cover image

Published In

Journal of Heuristics

DOI

EISSN

1572-9397

ISSN

1381-1231

Publication Date

June 1, 2018

Volume

24

Issue

3

Start / End Page

295 / 320

Related Subject Headings

  • Operations Research
  • 4901 Applied mathematics
  • 4602 Artificial intelligence
  • 0802 Computation Theory and Mathematics
  • 0801 Artificial Intelligence and Image Processing
  • 0102 Applied Mathematics