Optimization Strategies for Integrated Knapsack and Traveling Salesman Problems

Andreas Beham, Judith Scagnetti, Michael Kommenda, Stefan Wagner, Stephan Winkler, Michael Affenzeller

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

12 Citations (Scopus)

Abstract

In the optimization of real-world activities the effects of solutions on related activities need to be considered. The use of isolated problem models that do not adequately consider related processes does not allow addressing system-wide consequences. However, sometimes the complexity of the real-world model and its interplay with related activities can be described by a combination of simple, existing, problems. In this work we aim to discuss strategies to combine existing algorithms for simple problems in order to solve a more complex master problem. New challenges arise in such an integrated optimization approach.
Original languageEnglish
Title of host publicationComputer Aided Systems Theory – EUROCAST 2015 - 15th International Conference, Revised Selected Papers
EditorsFranz Pichler, Roberto Moreno-Díaz, Alexis Quesada-Arencibia
PublisherSpringer
Pages359-366
Number of pages8
ISBN (Print)9783319273396
DOIs
Publication statusPublished - 2015
Event15th International Conference on Computer Aided Systems Theory, Eurocast 2015 - Las Palmas, Gran Canaria, Spain
Duration: 8 Feb 201513 Feb 2015
http://eurocast2015.fulp.ulpgc.es/

Publication series

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

Conference

Conference15th International Conference on Computer Aided Systems Theory, Eurocast 2015
Country/TerritorySpain
CityLas Palmas, Gran Canaria
Period08.02.201513.02.2015
Internet address

Fingerprint

Dive into the research topics of 'Optimization Strategies for Integrated Knapsack and Traveling Salesman Problems'. Together they form a unique fingerprint.

Cite this