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

Authors:
Ravindra K. Ahuja;James B. Orlin;Stefano Pallottino;Maria Grazia Scutellà
Affiliations:
-;-;-;-
Venue:
Transportation Science
Year:
2002

Citing 0
Cited 3

Shortest paths in time-dependent FIFO networks using edge load forecasts

Proceedings of the Second International Workshop on Computational Transportation Science
Network flow model for multi-energy systems

EE'10 Proceedings of the 5th IASME/WSEAS international conference on Energy & environment
Shortest path search from a physical perspective

COSIT'05 Proceedings of the 2005 international conference on Spatial Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.