Finding K shortest looping paths in a traffic-light network

Hsu Hao Yang, Yen Liang Chen

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

In this paper we consider a traffic-light network where every node in the network is associated with the constraint consisting of a repeated sequence of time windows. The constraint aims to simulate the operations of traffic-light control in an intersection of roads. With this kind of constraints in place, directions of routes when passing through the intersections can be formally modeled. The objective of this paper is to find the first K shortest looping paths in the traffic-light network. An algorithm of time complexity of O(rK 2|V1|3) is developed, where r is the number of different windows of a node and |V1| is the number of nodes in the original network.

Original languageEnglish
Pages (from-to)571-581
Number of pages11
JournalComputers and Operations Research
Volume32
Issue number3
DOIs
StatePublished - Mar 2005

Keywords

  • Looping path
  • Shortest path
  • Traffic-light

Fingerprint

Dive into the research topics of 'Finding K shortest looping paths in a traffic-light network'. Together they form a unique fingerprint.

Cite this