Multi-objective and multi-constrained non-additive shortest path problems

作者：Reinhardt Line Blander^*; Pisinger David

来源：Computers & Operations Research, 2011, 38(3): 605-616.

DOI：10.1016/j.cor.2010.08.003

• Multi objective programming
• Shortest path problem
• Non-additive objective
• Dynamic programming

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.

• 出版日期2011-3