Predictive Traffic Assignment: A New Method and System for Optimal Balancing of Road Traffic

One of the most prevalent problems for people living in big cities is traffic congestion. To avoid traffic jam, drivers tend to use intelligent traffic-aware route planning service to help them save travel time. While the existing traffic-aware systems independently compute the fastest route based on the current and/or historical traffic condition, they ignore the fact that the uncoordinated decision based on the identical traffic view could lead to new congestion in the future. We propose a novel online route planning system called Predictive Traffic Assignment or PTA that exploits previous planned routes to accurately predict their impact on future traffic. Based on the dynamic prediction, PTA system computes the optimal route for each vehicle. Because it accounts for the impact of the previous vehicles, PTA coordinately assigns different routes to vehicles such that the traffic load is balanced among these routes. We present the models of PTA and implement PTA with an efficient algorithm. We conducted extensive simulation studies based on actual city maps. Simulations show that PTA significantly outperforms the state-of-the-art online and offline approaches. We also show that PTA could result in great saving in travel time, fuel consumption and GHG emissions even if only a small portion of vehicles use PTA.

[1]  Malachy Carey Nonconvexity of the dynamic traffic assignment problem , 1992 .

[2]  Xinbing Wang,et al.  CityDrive: A map-generating and speed-optimizing driving system , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[3]  Karine Zeitouni,et al.  Proactive Vehicular Traffic Rerouting for Lower Travel Time , 2013, IEEE Transactions on Vehicular Technology.

[4]  James H. Banks Introduction to Transportation Engineering , 1997 .

[5]  George L. Nemhauser,et al.  Optimality Conditions for a Dynamic Traffic Assignment Model , 1978 .

[6]  Shashi Shekhar,et al.  Spatio-temporal Network Databases and Routing Algorithms: A Summary of Results , 2007, SSTD.

[7]  Hani S. Mahmassani,et al.  Dynamic Traffic Assignment and Simulation for Advanced Network Informatics (DYNASMART) , 1995 .

[8]  Yosef Sheffi,et al.  Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .

[9]  Terence Kelly,et al.  Relaxation Criteria for Iterated Traffic Simulations , 1998 .

[10]  Athanasios K. Ziliaskopoulos,et al.  Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future , 2001 .

[11]  N B Taylor CONTRAM 5: AN ENHANCED TRAFFIC ASSIGNMENT MODEL , 1990 .

[12]  Christian Gawron,et al.  Simulation-Based Traffic Assignment. Computing user equilibria in large street networks , 1998 .

[13]  Dinesh Manocha,et al.  Self-Aware Traffic Route Planning , 2011, AAAI.

[14]  Robert L. Smith,et al.  Fastest Paths in Time-dependent Networks for Intelligent Vehicle-Highway Systems Application , 1993, J. Intell. Transp. Syst..

[15]  Jon Bottom,et al.  Dynamic Traffic Assignment: A Primer , 2011 .

[16]  Terry L. Friesz,et al.  A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem , 1993, Oper. Res..

[17]  Ariel Orda,et al.  Architecting noncooperative networks , 1995, Eighteenth Convention of Electrical and Electronics Engineers in Israel.

[18]  J. Correa,et al.  WARDROP EQUILIBRIA , 2010 .