Finding the K shortest paths in a time-schedule network with constraints on arcs

We study a new variant of the time-constrained shortest path problem (TCSPP), that is, the K shortest paths problem in a time-schedule network with constraints on arcs. In such networks, each arc has a list of pre-specified departure times, and traversal along the arc can only take place at one of those departure times. We develop a solution algorithm that finds the K shortest looping paths in O(mlog(nr)+Kmr^[email protected]) time, where n is the number of nodes, m is the number of arcs, r is the maximum number of departure times on an arc, and @h is the maximum in-degree of a node. Computational experiments show that our algorithm outperforms existing ones adapted to solve the same problem.

[1]  Yen-Liang Chen,et al.  Finding the first K shortest paths in a time-window network , 2004, Comput. Oper. Res..

[2]  Santosfeqvm,et al.  A NEW ALGORITHM FOR RANKING LOOPLESS PATHS , 1997 .

[3]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[4]  Hsu-Hao Yang,et al.  Finding K shortest looping paths with waiting time in a time–window network , 2006 .

[5]  Kwei Tang,et al.  Finding theKth shortest path in a time-schedule network , 2005 .

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

[7]  Hsu-Hao Yang,et al.  Shortest paths in traÅc-light networks , 2000 .

[8]  E. Martins,et al.  An algorithm for the ranking of shortest paths , 1993 .

[9]  Konstantinos G. Zografos,et al.  Solving the k-shortest path problem with time windows in a time varying network , 2008, Oper. Res. Lett..

[10]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[11]  Kwei Tang,et al.  The first K minimum cost paths in a time-schedule network , 2001, J. Oper. Res. Soc..

[12]  Yen-Liang Chen,et al.  Finding K shortest looping paths in a traffic-light network , 2005, Comput. Oper. Res..

[13]  Douglas R. Shier,et al.  Computational experience with an algorithm for finding the k shortest paths in a network , 1974 .

[14]  Marta M. B. Pascoal,et al.  The k Shortest Paths Problem , 1998 .

[15]  Yen-Liang Chen,et al.  Minimum time paths in a network with mixed time constraints , 1998, Comput. Oper. Res..

[16]  Yen-Liang Chen,et al.  Shortest paths in traffic-light networks , 2000 .

[17]  E. Martins.  An algorithm for ranking paths that may contain cycles , 1984 .

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