Shortest paths in traffic-light networks

Yen Liang Chen, Hsu Hao Yang

Research output: Contribution to journalArticlepeer-review

36 Scopus citations

Abstract

The time-constrained shortest path problem (TCSPP) is an important generalization of the shortest path problem (SPP) and has attracted widespread research interest in recent years. This paper presents a novel time constraint, called traffic-light constraint, to simulate the operations of traffic-light control encountered in intersections of roads. Basically, the constraint consists of a repeated sequence of time windows. In each window, only the cars in specified routes are allowed to pass through the intersection. In a practical sense, this means that a car needs to wait if the light for its direction is red and can go if it is green. For this kind of network, a shortest path algorithm of time complexity O(r×n3) is developed, where n denotes the number of nodes in the network and r the number of different windows in a node. In addition, we also prove that the time complexity of this algorithm is optimal.

Original languageEnglish
Pages (from-to)241-253
Number of pages13
JournalTransportation Research Part B: Methodological
Volume34
Issue number4
DOIs
StatePublished - May 2000

Keywords

  • Road network
  • Shortest path
  • Time window
  • Traffic light

Fingerprint

Dive into the research topics of 'Shortest paths in traffic-light networks'. Together they form a unique fingerprint.

Cite this