Solving the traveling thief problem using orchestration in optimization networks

Research output: Chapter in Book/Report/Conference proceedingsConference contributionpeer-review

Abstract

Optimization problems can sometimes be divided into multiple subproblems. Working on these subproblems instead of the actual master problem can have some advantages, e.g. if they are standard problems, it is possible to use already existing algorithms, whereas specialized algorithms would have to be implemented for the master problem. In this paper we approach the NP-hard Traveling Thief Problem by implementing different cooperative approaches using optimization networks. Orchestration is used to guide the algorithms that solve the respective subproblems. We conduct experiments on some instances of a larger benchmark set to compare the different network approaches to best known results, as well as a sophisticated, monolithic approach. Using optimization networks, we are able to find new best solutions for all of the selected problem instances.

Original languageEnglish
Title of host publicationComputer Aided Systems Theory – EUROCAST 2017 - 16th International Conference, Revised Selected Papers
EditorsRoberto Moreno-Diaz, Alexis Quesada-Arencibia, Franz Pichler
PublisherSpringer
Pages307-315
Number of pages9
ISBN (Print)9783319747170
DOIs
Publication statusPublished - 2018
Event16th International Conference on Computer Aided Systems Theory, EUROCAST 2017 - Las Palmas de Gran Canaria, Spain
Duration: 19 Feb 201724 Feb 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10671 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Conference on Computer Aided Systems Theory, EUROCAST 2017
Country/TerritorySpain
CityLas Palmas de Gran Canaria
Period19.02.201724.02.2017

Keywords

  • Evolutionary algorithm
  • HeuristicLab
  • Metaheuristic
  • Optimization network
  • Traveling thief problem

Fingerprint

Dive into the research topics of 'Solving the traveling thief problem using orchestration in optimization networks'. Together they form a unique fingerprint.

Cite this