A comprehensive survey on the quickest path problem

This work is a survey on a special minsum-maxmin bicriteria problem, known as the quickest path problem, that can model the transmission of data between two nodes of a network. Moreover, the authors review the problems of ranking the K quickest paths, and the K quickest loopless paths, and compare them in terms of the worst-case complexity order. The classification presented led to the proposal of a new variant of a known K quickest loopless paths algorithm. Finally, applications of quickest path algorithms are mentioned, as well as some comparative empirical results.

[1]  Michael H. Moore.  On the Fastest Route for Convoy-Type Traffic in Flowrate-Constrained Networks , 1976 .

[2]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[3]  Y. H. Chin,et al.  The quickest path problem , 1990, Comput. Oper. Res..

[4]  E. Martins.  On a special class of bicriterion path problems , 1984 .

[5]  Ernesto de Queirós Vieira Martins,et al.  An algorithm for the quickest path problem , 1997, Oper. Res. Lett..

[6]  Yen-Liang Chen,et al.  An algorithm for finding the k quickest paths in a network , 1993, Comput. Oper. Res..

[7]  E. Martins,et al.  A bicriterion shortest path algorithm , 1982 .

[8]  João C. N. Clímaco,et al.  An algorithm for ranking quickest simple paths , 2005, Comput. Oper. Res..

[9]  Pierre Hansen,et al.  Bicriterion Path Problems , 1980 .

[10]  Blas Pelegrín,et al.  The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets , 2002, RAIRO Oper. Res..

[11]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[12]  Yi-Kuei Lin,et al.  Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network , 2003, Comput. Oper. Res..

[13]  Nageswara S. V. Rao,et al.  Probabilistic quickest path algorithm , 2004, Theor. Comput. Sci..

[14]  Marta M. B. Pascoal,et al.  The Optimal Path Problem , 1999 .

[15]  Spyros Tragoudas,et al.  On the Computation of Fast Data Transmissions in Networks with Capacities and Delays , 1995, WADS.

[16]  João C. N. Clímaco,et al.  Internet packet routing: Application of a K , 2007, Eur. J. Oper. Res..

[17]  J. A. Mesa,et al.  Multiobjective routing problems , 1995 .

[18]  J. Ben Rosen,et al.  Algorithms for the quickest path problem and the enumeration of quickest paths , 1991, Comput. Oper. Res..

[19]  D. T. Lee,et al.  The All-Pairs Quickest Path Problem , 1993, Inf. Process. Lett..

[20]  Herminia I. Calvete.  The quickest path problem with interval lead times , 2004, Comput. Oper. Res..

[21]  Y. L. Chen,et al.  Finding the k Quickset Simple Paths in a Network , 1994, Inf. Process. Lett..

[22]  Marta M. B. Pascoal,et al.  Deviation Algorithms for Ranking Shortest Paths , 1999, Int. J. Found. Comput. Sci..

[23]  C. Zaroliagis,et al.  Transmissions in a Network with Capacities and Delays , 1999 .

[24]  Toshihide Ibaraki,et al.  An efficient algorithm for K shortest simple paths , 1982, Networks.