Article thumbnail

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

By Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino and Maria Grazia Scutellà

Abstract

We shall investigate minimum time and minimum cost path problems in street networks regulated by traffic lights. We shall show that the minimum time path problem is polynomially solvable. On the other hand, in general minimum cost path problems are NP-hard. Particular but realistic cases which are polynomially solvable will be discussed

Topics: INF/01 - Informatica
Publisher: Università di Pisa
Year: 1999
OAI identifier: oai:eprints.adm.unipi.it:2016
Provided by: UnipiEprints
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://eprints.adm.unipi.it/20... (external link)
  • http://eprints.adm.unipi.it/20... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.