Pisinger, David

Reinhardt, Line Blander

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 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

Online Research Database In Technology

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

http://orbit.dtu.dk/ws/files/4050584/2009_16.pdf

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

Abstract

Similar works

Full text

Available Versions

Online Research Database In Technology