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

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Chabini I. A new short path algorithm for discrete dynamic networks. Proc. 8th IFAC Sympos. Transport Systems (1997) Chania Greece(June 16-17):551–556Google Scholar
• Chabini I. Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time. Transportation Res. Record (1998) 1645:170–175Crossref, Google Scholar
• Desrochers M., Soumis F. A generalized permanent labelling algorithm for the shortest path problem with time windows. INFOR (1988) 26(3):191–212Google Scholar
• Desrosiers J., Pelletier P., Soumis F. Plus court chemin avec contraintes d'horaires. R.A.I.R.O. (1983) 17(4):357–377Google Scholar
• Dial R. B. Algorithm 360: Shortest path forest with topological ordering. Comm. ACM (1969) 12:632–633Crossref, Google Scholar
• Dreyfus S. E. An appraisal of some shortest-path algorithms. Oper. Res. (1969) 17:395–412Link, Google Scholar
• Kaufmann D. E., Smith R. L. Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. IVHS J. (1993) 1(1):1–11Google Scholar
• Kirby R. F ., Potts R. B. The minimum route problem for networks with turn penalties and prohibitions. Transportation Res. (1969) 3:397–408Crossref, Google Scholar
• Orda A., Rom R. Shortest-path and minimum-delay algorithms in network with time-dependent edge length. J. ACM (1990) 37(3):607–625Crossref, Google Scholar
• Orda A., Rom R. Minimum weight paths in time-dependent network. Networks (1991) 21(3):295–320Crossref, Google Scholar
• Pallottino S., Scutellà M. G. Shortest path algorithms in transportation models: Classical and innovative aspects. Equilibrium and Advanced Transportation Modelling (1998) (Kluwer Academic Publishers, Boston, MA) 245–281Crossref, Google Scholar
• Wardell W. W ., Ziliaskopoulos A. K. A intermodal optimum path algorithm for dynamic multimodal networks. Eur. J. Oper. Res. (2000) 125:486–502Crossref, Google Scholar
• Ziliaskopoulos A. K. Optimum path algorithms on multidimensional networks: Analysis design, implementation and computational experience. (1994) . Ph. D. dissertation, University of Texas at Austin, Austin, TXGoogle Scholar
• Ziliaskopoulos A. K., Mahmassani H. S. On finding least time paths considering delays for intersection movements. Transportation Res. (1996) 30B(5):359–367Crossref, Google Scholar