Deakin University
Browse

File(s) under permanent embargo

A comprehensive benchmark set and heuristics for the traveling thief problem

Version 2 2024-06-04, 14:21
Version 1 2018-08-09, 11:15
conference contribution
posted on 2024-06-04, 14:21 authored by Sergey PolyakovskiySergey Polyakovskiy, MR Bonyadi, M Wagner, Z Michalewicz, F Neumann
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 bench-mark 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. © 2014 ACM.

History

Pagination

477-484

Location

Vancouver, Canada

Start date

2014-07-12

End date

2014-07-16

ISBN-13

9781450326629

Language

eng

Publication classification

E1.1 Full written paper - refereed

Copyright notice

2014, ACM

Title of proceedings

GECCO 2014 - Proceedings of the 2014 Genetic and Evolutionary Computation Conference

Event

Annual Conference on Genetic and Evolutionary Computation (2014 : Vancouver, Canada)

Publisher

ACM

Place of publication

New York, N.Y.

Usage metrics

    Research Publications

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC