Traffic signal optimization using cyclically expanded networks

Traditionally, the coordination of multiple traffic signals and the traffic assignment problem in an urban street network are considered as two separate optimization problems. However, it is easy to see that the traffic assignment has an influence on the optimal signal coordination and, vice versa, a change in the signal coordination changes the optimal traffic assignment. In this paper we present a cyclically time-expanded network and a corresponding mixed integer linear programming formulation for simultaneously optimizing both the coordination of traffic signals and the traffic assignment in an urban street network. Although the new cyclically time-expanded network provides a model of both traffic and signals close to reality, it still has the advantage of a linear objective function. Using this model we compute optimized signal coordinations and traffic assignment on real-world street networks. To evaluate the practical relevance of the computed solutions we conduct extensive simulation experiments using two established traffic simulation tools that reveal the advantages of our model.

[1]  R. D. Bretherton,et al.  AGEING OF FIXED-TIME TRAFFIC SIGNAL PLANS , 1986 .

[2]  Michael G.H. Bell,et al.  Traffic signal timing optimisation based on genetic algorithm approach, including drivers’ routing , 2004 .

[3]  Stefan Lämmer,et al.  Reglerentwurf zur dezentralen Online-Steuerung von Lichtsignalanlagen in Straßennetzwerken , 2007 .

[4]  R E Allsop,et al.  TRAFFIC IN A SIGNAL-CONTROLLED ROAD NETWORK: AN EXAMPLE OF DIFFERENT SIGNAL TIMINGS INCLUDING DIFFERENT ROUTEING , 1977 .

[5]  Agachai Sumalee,et al.  A Genetic Algorithm Approach for Optimizing Traffic Control Signals Considering Routing , 2007, Comput. Aided Civ. Infrastructure Eng..

[6]  Martin Skutella,et al.  Time-Expanded Graphs for Flow-Dependent Transit Times , 2002, ESA.

[7]  Ravindra K. Ahuja,et al.  Network Flows , 2011 .

[8]  Dazhi Sun,et al.  Multi-objective Traffic Signal Timing Optimization Using Non-dominated Sorting Genetic Algorithm II , 2003, GECCO.

[9]  Tim Roughgarden,et al.  Selfish routing and the price of anarchy , 2005 .

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  John D. C. Little,et al.  Optimization of Traffic Signal Settings by Mixed-Integer Linear Programming , 1975 .

[12]  Walter Ukovich,et al.  A Mathematical Model for Periodic Scheduling Problems , 1989, SIAM J. Discret. Math..

[13]  D. Schrank,et al.  2001 Urban Mobility Report , 2001 .

[14]  Rolf H. Möhring,et al.  Traffic Networks and Flows over Time , 2009, Algorithmics of Large and Complex Networks.

[15]  Suh-Wen Chiou,et al.  Optimization of Area Traffic Control for Equilibrium Network Flows , 1999, Transp. Sci..

[16]  John D. C. Little,et al.  SYNCHRONIZING TRAFFIC SIGNALS FOR MAXIMAL BANDWIDTH , 1964 .