Robust Shortest Path Problems

Gabrel, Virginie; Murat, Cécile

doi:10.1002/9781118600207.ch19

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2018

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reference uses a concept similar to Pareto efficiency to solve robust shortest path problems. For an overview on solution approaches for the robust shortest path problem with various robustness concepts and uncertainty sets, see, for example, .…”

Section: Introductionmentioning

confidence: 99%

Extensions of labeling algorithms for multi‐objective uncertain shortest path problems

et al. 2018

View full text Add to dashboard Cite

We consider multi‐objective shortest path problems in which the edge lengths are uncertain. Different concepts for finding so‐called robust efficient solutions for multi‐objective robust optimization exist. In this article, we consider multi‐scenario efficiency, flimsily and highly robust efficiency, and point‐based and set‐based minmax robust efficiency. Labeling algorithms are an important class of algorithms for multi‐objective (deterministic) shortest path problems. We analyze why it is, for most of the considered concepts, not straightforward to use labeling algorithms to find robust efficient solutions. We then show two approaches to extend a generic multi‐objective label correcting algorithm for these cases. We finally present extensive numerical results on the performance of the proposed algorithms.

show abstract

Section: Introductionmentioning

confidence: 99%