A comprehensive benchmark set and heuristics for the traveling thief problem

Simple item page
dc.contributor.authorPolyakovskiy, S.
dc.contributor.authorBonyadi, M.
dc.contributor.authorWagner, M.
dc.contributor.authorMichalewicz, Z.
dc.contributor.authorNeumann, F.
dc.contributor.conference2014 Genetic and Evolutionary Computation Conference (GECCO 2014) (12 Jul 2014 - 16 Jul 2014 : Vancouver, Canada)
dc.contributor.editorIgel, C.
dc.date.issued2014
dc.description.abstractReal-world optimization problems often consist of several NP-hard optimization problems that interact with each other. The goal of this paper is to provide a benchmark suite that promotes a research of the interaction between problems and their mutual influence. We establish a comprehensive benchmark suite for the traveling thief problem (TTP) which combines the traveling salesman problem and the knapsack problem. Our benchmark suite builds on common benchmarks for the two sub-problems which grant a basis to examine the potential hardness imposed by combining the two classical problems. Furthermore, we present some simple heuristics for TTP and their results on our benchmark suite.
dc.description.statementofresponsibilitySergey Polyakovskiy, Mohammad Reza Bonyadi, Markus Wagner, Zbigniew Michalewicz, Frank Neumann
dc.identifier.citationGECCO 2014 - Proceedings of the 2014 Genetic and Evolutionary Computation Conference, 2014 / Igel, C. (ed./s), pp.477-484
dc.identifier.doi10.1145/2576768.2598249
dc.identifier.isbn978-1-4503-2881-4
dc.identifier.orcidPolyakovskiy, S. [0000-0001-9489-1972]
dc.identifier.orcidWagner, M. [0000-0002-3124-0061]
dc.identifier.orcidNeumann, F. [0000-0002-2721-3618]
dc.identifier.urihttp://hdl.handle.net/2440/97074
dc.language.isoen
dc.publisherAssociation for Computing Machinery
dc.relation.granthttp://purl.org/au-research/grants/arc/DP130104395
dc.relation.granthttp://purl.org/au-research/grants/arc/DP140103400
dc.rightsCopyright 2014 ACM
dc.source.urihttps://doi.org/10.1145/2576768.2598249
dc.subjectTraveling thief problem
dc.subjectknapsack problem
dc.subjectinterdependence
dc.subjectbenchmarks
dc.titleA comprehensive benchmark set and heuristics for the traveling thief problem
dc.typeConference paper
pubs.publication-statusPublished

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
RA_hdl_97074.pdf
Size:
490.16 KB
Format:
Adobe Portable Document Format
Description:
Restricted Access
Download

Collections

Computer Science publications