Article ID: | iaor1993248 |
Country: | United States |
Volume: | 25A |
Issue: | 5 |
Start Page Number: | 241 |
End Page Number: | 249 |
Publication Date: | Sep 1991 |
Journal: | Transportation Research. Part A, Policy and Practice |
Authors: | Sforza Antonio, Cantarella E. Giulio, Improta Gennaro |
The Equilibrium Network Traffic Signal Setting problem is an open research area. It can be approached using global optimization models or iterative procedures. In this paper, after a brief review of the state of the art, the main characteristics of the iterative procedure ENETS are described. In this procedure, traffic signal setting is performed in two successive steps: green timing and scheduling at each junction, and signal coordination on the network. Green timing and scheduling at a single junction is based on a mixed-binary linear program with capacity factor maximization. Signal coordination for the whole network is performed by solving a discrete programming model with total delay minimization. The flow assignment stage refers to the separable user equilibrium model with fixed demand, and uses a feasible direction algorithm, which can also be adopted to cover the cases of elastic demand and/or asymmetric equilibrium. An experimental test of ENETS on a small network and a graphical explanation of the procedure are described and discussed.