Abstract
The quickest path problem consists of finding a path in a directed network to transmit a given amount of items from an origin node to a destination node with minimal transmission time, when the transmission time depends on both the traversal times of the arcs, or lead time, and the rates of flow along arcs, or capacity. In telecommunications networks, arcs often also have an associated operational probability of the transmission being fault free. The reliability of a path is defined as the product of the operational probabilities of its arcs. The reliability as well as the transmission time are of interest. In this paper, algorithms are proposed to solve the quickest path problem as well as the problem of identifying the quickest path whose reliability is not lower than a given threshold. The algorithms rely on both the properties of a network which turns the computation of a quickest path into the computation of a shortest path and the fact that the reliability of a path can be evaluated through the reliability of the ordered sequence of its arcs. Other constraints on resources consumed, on the number of arcs of the path, etc. can also be managed with the same algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aneja YP, Aggarwal V, Nair KPK (1983) Shortest chain subject to side constraints. Networks 13: 295–302
Calvete HI (2004) The quickest path problem with interval lead times. Comput Oper Res 31(3): 383–395
Calvete HI, del-Pozo L (2003) The quickest path problem with batch constraints. Oper Res Lett 31(4): 277–284
Chen GH, Hung YC (1994) Algorithms for the constrained quickest path problem and the enumeration of quickest paths. Comput Operat Res 21: 113–118
Chen YL (1994) Finding the k quickest simple paths in a network. Inform Process Lett 50: 89–92
Chen YL, Chin YH (1990) The quickest path problem. Comput Oper Res 17(2): 153–161
Fredman ML, Tarjan RE (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J Assoc Comput Mach 34(3): 596–615
Klingman D, Napier A, Stutz J (1974) Netgen: a program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems. Manag Sci 20(5): 814–821
Lawler E (1976) Combinatorial optimization: networks and matroids. Holt, Rinehart & Winston, New York
Martins EQV, Santos JLE (1997) An algorithm for the quickest path problem. Oper Res Lett 20(4): 195–198
Moore MH (1976) On the fastest route for convoy-type traffic in flowrate-constrained networks. Transp Sci 10(2): 113–124
Park C-K, Lee S, Park S (2004) A label-setting algorithm for finding a quickest path. Comput Oper Res 31(14): 2405–2418
Pascoal MMB, Captivo MEV, Clímaco JCN (2006) A comprehensive survey on the quickest path problem. Ann Oper Res 147(1): 5–21
Rosen JB, Sun SZ, Xue GL (1991) Algorithms for the quickest path problem and the enumeration of quickest paths. Comput Oper Res 18(6): 579–584
Xue G (1998) End-to-end data paths: quickest or most reliable?. IEEE Commun Lett 2(6): 156–158
Yen J (1971) Finding the k shortest loopless paths in a network. Manag Sci 17(11): 712–716
Author information
Authors and Affiliations
Corresponding author
Additional information
This research work has been funded by the Spanish Ministry of Education and Science under grants MTM2007-66893 and MTM2010-17559.
Rights and permissions
About this article
Cite this article
Calvete, H.I., del-Pozo, L. & Iranzo, J.A. Algorithms for the quickest path problem and the reliable quickest path problem. Comput Manag Sci 9, 255–272 (2012). https://doi.org/10.1007/s10287-012-0138-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10287-012-0138-2