2011
DOI: 10.1016/j.cor.2010.08.003
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 multi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
28
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 58 publications
(28 citation statements)
references
References 21 publications
0
28
0
Order By: Relevance
“…In addition, in this study, we assume the route set is known a priori which can be obtained using a choice set generation method [53,54]. For large-sized problems, it is more suitable to use a route-generation procedure (e.g., [2,19]) that embeds a nonadditive shortest path problem (e.g., [55][56][57]) to generate routes on a need basis in each iteration. We will explore these issues in our future research.…”
Section: Discussionmentioning
confidence: 99%
“…In addition, in this study, we assume the route set is known a priori which can be obtained using a choice set generation method [53,54]. For large-sized problems, it is more suitable to use a route-generation procedure (e.g., [2,19]) that embeds a nonadditive shortest path problem (e.g., [55][56][57]) to generate routes on a need basis in each iteration. We will explore these issues in our future research.…”
Section: Discussionmentioning
confidence: 99%
“…MSPPs are solved for example with labeling algorithms and dynamic programming [9,13,18] or with Markov decision processes [21]. A comparison for some of the solution methods is given in [17,20].…”
Section: Literature Reviewmentioning
confidence: 99%
“…The integer programming formulation for the multi-objective shortest path problem from Node s to Node t can be given as follows [12]:…”
Section: Graphs the Adjacency Set A(i) For Node I Is The Set Of Allmentioning
confidence: 99%