Please use this identifier to cite or link to this item: http://hdl.handle.net/2440/112684
Citations
Scopus Web of Science® Altmetric
?
?
Type: Journal article
Title: A case study of algorithm selection for the traveling thief problem
Author: Wagner, M.
Lindauer, M.
Mısır, M.
Nallaperuma, S.
Hutter, F.
Citation: Journal of Heuristics, 2018; 24(3):295-320
Publisher: Springer
Issue Date: 2018
ISSN: 1381-1231
1572-9397
Statement of
Responsibility: 
Markus Wagner, Marius Lindauer, Mustafa Mısır, Samadhi Nallaperuma, Frank Hutter
Abstract: 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.
Keywords: Combinatorial optimization; instance analysis; algorithm portfolio
Description: Published online: 7 April 2017
Rights: © Her Majesty the Queen in Right of Australia 2017
RMID: 0030068910
DOI: 10.1007/s10732-017-9328-y
Grant ID: http://purl.org/au-research/grants/arc/DE160100850
Appears in Collections:Computer Science publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.