An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths

Authors:
Chiun-Chieh Hsu;Da-Ren Chen;Hua-Yuan Ding
Affiliations:
Department of Information Management, National Taiwan University of Science and Technology, Taipei, 106, Taiwan, R.O.C.;Department of Information Management, Hwa Hsia Institute of Technology, Taipei, 235, Taiwan, R.O.C.;Department of Information Management, National Taiwan University of Science and Technology, Taipei, 106, Taiwan, R.O.C.
Venue:
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Year:
2009

Citing 8
Cited 0

Finding the k Shortest Paths

SIAM Journal on Computing
A Method for the Solution of the Nth Best Path Problem

Journal of the ACM (JACM)
An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions

Computers and Operations Research
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison

WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Vehicle Routing and Scheduling with Full Truckloads

Transportation Science
Finding the first K shortest paths in a time-window network

Computers and Operations Research
Finding K shortest looping paths in a traffic-light network

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we discuss the shortest path problem with forbidden paths (SPPFP), where the constraints come from a set of forbidden paths (arc sequences) that cannot be part of any feasible solution. SPPFP can be used to solve the problems with hard-to-modeled path constraints or to implement exact branching scheme.The method proposed by Villeneuve and Desaulniers first transfer the SPPFP problem to the k -shortest paths problem. We propose an algorithm which reduces execution time of solving the SPPFP problem via a nodes combination process. It improves the approach proposed by Villeneuve and Desaulniers. In addition, their algorithm for generating augmented paths could cause the inconsistency in particular situations. The proposed method also improves the weakness without increasing its time complexity.