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 po...

Full description

Saved in:

Bibliographic Details
Published in:	Transportation science Vol. 36; no. 3; pp. 326 - 336
Main Authors:	Ahuja, Ravindra K, Orlin, James B, Pallottino, Stefano, Grazia Scutella, Maria
Format:	Journal Article
Language:	English
Published:	Linthicum, MD INFORMS 01-08-2002 Transportation Science Section of the Operations Research Society of America Institute for Operations Research and the Management Sciences
Subjects:	Algorithms Applied sciences Cost efficiency Exact sciences and technology Ground, air and sea transportation, marine construction Minimization of cost Networks Road intersections Road transportation and traffic Spacetime Time Time windows Traffic Traffic lights Transport Transportation Transportation planning, management and economics Travel expenses Travel time Triplets Traffic lights Travel time Shortest path Road network Cost function Minimization Numerical simulation Road traffic Dynamic model
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
Bibliography:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	0041-1655 1526-5447
DOI:	10.1287/trsc.36.3.326.7827