Minimum time and minimum cost-path problems in street networks with periodic traffic lights

Minimum time and minimum cost-path problems in street networks with periodic traffic lights

0.00 Avg rating0 Votes
Article ID: iaor20032898
Country: United States
Volume: 36
Issue: 3
Start Page Number: 326
End Page Number: 336
Publication Date: Aug 2002
Journal: Transportation Science
Authors: , , ,
Keywords: networks: path
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.

Reviews

Required fields are marked *. Your email address will not be published.