Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights

This paper investigates minimum time and minimum cost path problems in street networks regulated by periodic traffic lights. We show that the minimum time path problem is polynomially solvable. On the other hand, minimum cost path problems are generally NP-hard. Special, realistic cases which are polynomially solvable are discussed.

[1]  M. Desrochers,et al.  A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows , 1988 .

[2]  Athanasios K. Ziliaskopoulos,et al.  An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays , 2000, Eur. J. Oper. Res..

[3]  S. Pallottino,et al.  Shortest Path Algorithms in Transportation models: classical and innovative aspects , 1997 .

[4]  Ariel Orda,et al.  Minimum weight paths in time-dependent networks , 1991, Networks.

[5]  OrdaAriel,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990 .

[6]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[7]  Robert B. Dial,et al.  Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

[8]  Athanasios K. Ziliaskopoulos.  Optimum path algorithms on multidimensional networks: Analysis, design, implementation and computational experience. , 1996 .

[9]  D E Kaufman,et al.  FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR IVHS APPLICATION , 1993 .

[10]  Ronald F. Kirby,et al.  The minimum route problem for networks with turn penalties and prohibitions , 1969 .

[11]  J. Desrosiers,et al.  Plus court chemin avec contraintes d'horaires , 1983 .

[12]  Hani S. Mahmassani,et al.  A note on least time path computation considering delays and prohibitions for intersection movements , 1996 .

[13]  Ismail Chabini,et al.  Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time , 1998 .

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

[15]  Robert L. Smith,et al.  Fastest Paths in Time-dependent Networks for Intelligent Vehicle-Highway Systems Application , 1993, J. Intell. Transp. Syst..