Research Paper
Shortest path problem with arc failure scenarios

https://doi.org/10.1007/s13676-015-0092-6Get rights and content
Under a Creative Commons license
open access

Abstract

We consider a shortest path problem from source to destination over a set of arc failure scenarios, considering the probability of different scenarios. A primary path is chosen, which is the first path a driver will take, along with a set of alternative paths to use when an impassible road is encountered. These paths should minimize the expected cost to reach the destination and be useful in natural disaster applications. Our paper includes a formal problem description and integer programming model for this new problem. We also provide an exact algorithm based on the modified label-correcting algorithm but with extended labels that preserve information about the scenarios. We describe dominance rules and how to use a version of the A-star algorithm to generate an initial bound. We conduct computational experiments with real road data sets with varying number of scenarios and disaster intensities. These experiments show the value of the dominance rules and initial bounds, as well as the structure of the chosen paths.

Keywords

Shortest path
Label correcting
Scenarios
Arc failures
Disasters

Cited by (0)