Article ID: | iaor20052245 |
Country: | United Kingdom |
Volume: | 32 |
Issue: | 3 |
Start Page Number: | 571 |
End Page Number: | 581 |
Publication Date: | Mar 2005 |
Journal: | Computers and Operations Research |
Authors: | Chen Yen-Liang, Yang Hsu-Hao |
Keywords: | vehicle routing & scheduling, networks: path |
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 constraint in place, directions of routes when passing through the intersections can be formally modeled. The objective of this paper is to find the first