Real-time predication and navigation on traffic congestion model with equilibrium Markov chain

With the explosive growth of vehicles on the road, traffic congestion has become an inevitable problem when applying guidance algorithms to transportation networks in a busy and crowded city. In our study, the authors proposed an advanced prediction and navigation models on a dynamic traffic network. In contrast to the traditional shortest path algorithms, focused on the static network, the first part of our guiding method considered the potential traffic jams and was developed to provide the optimal driving advice for the distinct periods of a day. Accordingly, by dividing the real-time Global Positioning System data of taxis in Shenzhen city into 50 regions, the equilibrium Markov chain model was designed for dispatching vehicles and applied to ease the city congestion. With the reveals of our field experiments, the traffic congestion of city traffic networks can be alleviated effectively and efficiently, the system performance also can be retained.

[1]  R. Awan,et al.  Video Based Effective Density Measurement for Wireless Traffic Control Application , 2007, 2007 International Conference on Emerging Technologies.

[2]  Hani S. Mahmassani,et al.  Time dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications , 1993 .

[3]  Jesfis Peral,et al.  Heuristics -- intelligent search strategies for computer problem solving , 1984 .

[4]  Huan Wang,et al.  An actual urban traffic simulation model for predicting and avoiding traffic congestion , 2014, 17th International IEEE Conference on Intelligent Transportation Systems (ITSC).

[5]  David K. Smith Network Flows: Theory, Algorithms, and Applications , 1994 .

[6]  Liping Fu,et al.  An adaptive routing algorithm for in-vehicle route guidance system with real-time information , 2001 .

[7]  Ismaïl Chabini,et al.  Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks , 2002, IEEE Trans. Intell. Transp. Syst..

[8]  Zhao Li,et al.  Traffic Congestion Forecasting Based on Possibility Theory , 2016, Int. J. Intell. Transp. Syst. Res..

[9]  Bülent Çatay,et al.  Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge , 2014, Eur. J. Oper. Res..

[10]  Anand Gupta,et al.  DTC: A framework to Detect Traffic Congestion by mining versatile GPS data , 2013, 2013 1st International Conference on Emerging Trends and Applications in Computer Science.

[11]  J. Platt Sequential Minimal Optimization : A Fast Algorithm for Training Support Vector Machines , 1998 .

[12]  Andrew V. Goldberg,et al.  Route Planning in Transportation Networks , 2015, Algorithm Engineering.

[13]  Jörg-Rüdiger Sack,et al.  Shortest Paths in Time-Dependent FIFO Networks , 2010, Algorithmica.

[14]  K. Cooke,et al.  The shortest route through a network with time-dependent internodal transit times , 1966 .

[15]  Muhammad Tayyab Asif,et al.  Unsupervised learning based performance analysis of n-support vector regression for speed prediction of a large road network , 2012, 2012 15th International IEEE Conference on Intelligent Transportation Systems.

[16]  M. Tavana,et al.  A decremental approach with the A ⁄ algorithm for speeding-up the optimization process in dynamic shortest path problems , 2015 .

[17]  B. C. Dean Shortest Paths in FIFO Time-Dependent Networks : Theory and Algorithms , 2004 .

[18]  Sung-Soo Kim,et al.  Congestion Avoidance Algorithm Using Extended Kalman Filter , 2007, 2007 International Conference on Convergence Information Technology (ICCIT 2007).

[19]  D E Kaufman,et al.  FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR IVHS APPLICATION , 1993 .

[20]  Chen-Khong Tham,et al.  Multi-agent System based Urban Traffic Management , 2007, 2007 IEEE Congress on Evolutionary Computation.

[21]  Khaled Harfoush,et al.  Real-time traffic congestion management and deadlock avoidance for vehicular ad Hoc networks , 2013, 2013 High Capacity Optical Networks and Emerging/Enabling Technologies.

[22]  Larry J. LeBlanc,et al.  AN EFFICIENT APPROACH TO SOLVING THE ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM. IN: THE AUTOMOBILE , 1975 .

[23]  Patrick R. McMullen,et al.  Ant colony optimization techniques for the vehicle routing problem , 2004, Adv. Eng. Informatics.

[24]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[25]  Hani S. Mahmassani,et al.  Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks , 2003, Eur. J. Oper. Res..