A label-setting algorithm for finding a quickest path

Authors:
Chan-Kyoo Park;Sangwook Lee;Soondal Park
Affiliations:
Department of IT Audit and Supervision, National Computerization Agency, NCA Building, 77, Mugyo-dong, Jung-gu, Seoul 100-170, South Korea;Department of Industrial Engineering, Seoul National University, Kwanak-gu, Seoul 151-742, South Korea;Department of Industrial Engineering, Seoul National University, Kwanak-gu, Seoul 151-742, South Korea
Venue:
Computers and Operations Research
Year:
2004

Citing 9
Cited 12

The quickest path problem

Computers and Operations Research
Algorithms for the quickest path problem and the enumeration of quickest paths

Computers and Operations Research
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
On the quickest path problem

Information Processing Letters
Finding the k quickest simple paths in a network

Information Processing Letters
Fast data transmission and maximal dynamic flow

Information Processing Letters
Combinatorial Algorithms

Combinatorial Algorithms
Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network

Computers and Operations Research
An algorithm for the quickest path problem

Operations Research Letters

Routing policy of stochastic-flow networks under time threshold and budget constraint

Expert Systems with Applications: An International Journal
Time version of the shortest path problem in a stochastic-flow network

Journal of Computational and Applied Mathematics
Optimal routing policy of a stochastic-flow network

Computers and Industrial Engineering
Optimal pair of minimal paths under both time and budget constraints

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A method to evaluate routing policy through p minimal paths for stochastic case

Information Sciences: an International Journal
System reliability for quickest path problems under time threshold and budget

Computers & Mathematics with Applications
Quickest path distances on context-free labeled graphs

ISP'07 Proceedings of the 6th WSEAS international conference on Information security and privacy
Stochastic flow networks via multiple paths under time threshold and budget constraint

Computers & Mathematics with Applications
A method to evaluate the routing policy with two minimal paths within time threshold

Expert Systems with Applications: An International Journal
Transmission reliability of k minimal paths within time threshold

Computers and Industrial Engineering
Reliability-based route optimization of a transportation network with random arc capacities and time threshold

IUKM'11 Proceedings of the 2011 international conference on Integrated uncertainty in knowledge modelling and decision making
On performance evaluation for a multistate network under spare routing

Information Sciences: an International Journal

Quantified Score

Hi-index	0.02

Visualization

Abstract

The quickest path problem is to find a path to send a given amount of data from the source to the destination with minimum transmission time. To find the quickest path, existing algorithms enumerate nondominated paths with distinct capacity, and then determine a quickest path by comparing their transmission time. In this paper, we propose a label-setting algorithm for finding a quickest path by transforming a network to another network where an important property holds that each subpath of a quickest path is also a quickest path. The proposed algorithm avoids enumerating non-dominated paths whose transmission time is greater than the minimum transmission time. Although the computational complexity of the proposed algorithm is the same as that of existing algorithms, experimental results show that our algorithm is efficient when a network has two or more non-dominated paths.