Shortest paths in traffic-light networks

The time-constrained shortest path problem (TCSPP) is an important generali zation of the shortest path problem (SPP) and has attracted widespread rese arch interest in recent years. This paper presents a novel time constraint, called traffic-light constraint, to simulate the operations of traffic-lig ht 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 sho rtest path algorithm of time complexity O(r x n(3)) is developed, where n d enotes the number of nodes in the network and r the number of different win dows in a node. In addition, we also prove that the time complexity of this algorithm is optimal. (C) 2000 Elsevier Science Ltd. All rights reserved.