Journal article
Multi-Objective and Multi-Constrained Non-Additive Shortest Path Problems
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.
Language: | English |
---|---|
Publisher: | Elsevier BV |
Year: | 2011 |
Pages: | 605-616 |
ISSN: | 1873765x and 03050548 |
Types: | Journal article |
DOI: | 10.1016/j.cor.2010.08.003 |
ORCIDs: | Pisinger, David |