Multi-Objective and Multi-Constrained Non-Additive Shortest Path Problems

Publication: Research - peer-reviewJournal article – Annual report year: 2011

View graph of relations

Shortest path problems appear as subproblems in numerous optimization problems. In most papers concerning multiple objective shortest path problems, additivity of the objective is a de-facto assumption, but in many real-life situations objectives and criteria, can be non-additive. The purpose of this paper is to give a general framework for dominance tests for problems involving a number of non-additive criteria. These dominance tests can help to eliminate paths in a dynamic programming framework when using multiple objectives. Results on real-life multi-objective problems containing non-additive criteria are reported. We show that in many cases the framework can be used to efficiently reduce the number of generated paths.
Original languageEnglish
JournalComputers & Operations Research
Publication date2011
Volume38
Issue3
Pages605-616
ISSN0305-0548
DOIs
StatePublished
CitationsWeb of Science® Times Cited: 6

Keywords

  • non-additive objective, shortest path problem, dynamic programming, multi objective programming
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 5160238