Abstract 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.
Iterative procedure for equilibrium network traffic signal setting
Transportation Research Part A: General ; 25 , 5 ; 241-249
01.01.1991
9 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Global, Local, and Iterative Searches to the Equilibrium Network Traffic Signal Setting Problem
British Library Conference Proceedings | 1997
|Equilibrium Network Traffic Signal Setting Under Conditions of Queuing and Congestion
British Library Conference Proceedings | 1996
|An Iterative Group-based Signal Optimization Scheme for Traffic Equilibrium Networks
Online Contents | 1999
|Multiobjective Optimization of Equilibrium Network Signal Setting and Pricing
British Library Conference Proceedings | 1996
|