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

Authors:
Yen-Liang Chen;Hsu-Hao Yang
Affiliations:
Department of Information Management, National Central University, Chung-Li, Taiwan 320, Republic of China;Department of Industrial Engineering and Management, National Chinyi Institute of Technology, Taiping, Taiwan 411, Republic of China
Venue:
Computers and Operations Research
Year:
2004

Citing 4
Cited 3

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Vehicle routing with time windows

Operations Research
The quickest path problem

Computers and Operations Research
Finding the k Shortest Paths

SIAM Journal on Computing

An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths

ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Finding the K shortest paths in a schedule-based transit network

Computers and Operations Research
Finding the K shortest paths in a time-schedule network with constraints on arcs

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

The time-constrained shortest path problem is an important generalization of the classical shortest path problem and has attracted much research interest in recent years. We consider a time-window network, where every node in the network has a list of pre-specified windows and departure from a node may take place only in these window periods. The objective of this paper is to find the first K shortest paths in a time-window network. An algorithm of time complexity of O(Kr|V|3) is developed to find the first K shortest paths, where |V| is the numbers of nodes in the network and r represents the maximum number of windows associated with a node.