A comprehensive benchmark set and heuristics for the traveling thief problem
Files
(Restricted Access)
Date
2014
Authors
Polyakovskiy, S.
Bonyadi, M.
Wagner, M.
Michalewicz, Z.
Neumann, F.
Editors
Igel, C.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
GECCO 2014 - Proceedings of the 2014 Genetic and Evolutionary Computation Conference, 2014 / Igel, C. (ed./s), pp.477-484
Statement of Responsibility
Sergey Polyakovskiy, Mohammad Reza Bonyadi, Markus Wagner, Zbigniew Michalewicz, Frank Neumann
Conference Name
2014 Genetic and Evolutionary Computation Conference (GECCO 2014) (12 Jul 2014 - 16 Jul 2014 : Vancouver, Canada)
Abstract
Real-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.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2014 ACM