Reverse Online Algorithm for the Dynamic Traffic Assignment inspired by Ant Colony Optimization for VANETs

We present a novel decentralized and infrastructure-less algorithm to alleviate traffic congestions on road networks and to fill the void left by current algorithms which are either static, centralized, or require infrastructure. The algorithm follows an online approach that seeks stochastic user equilibrium and assigns traffic as it evolves in real time, without prior knowledge of the traffic demand or the schedule of the cars that will enter the road network in the future. Reverse Online Algorithm for the Dynamic Traffic Assignment inspired by Ant Colony Optimization for VANETs is a metaheuristic approach that uses reports from other vehicles to update the vehicle’s perceived view of the road network and change route if necessary. To alleviate the broadcast storm spontaneous clusters are created around traffic incidents and a threshold system based on the level of congestion is used to limit the number of incidents to be reported. Simulation results for the algorithm show a great improvement on travel time over routing based on shortest distance.

[1]  B. Chandra Mohan,et al.  A survey: Ant Colony Optimization based recent research and implementation on several engineering domain , 2012, Expert Syst. Appl..

[2]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .

[3]  Carlos F. Daganzo,et al.  Stochastic network equilibrium with multiple vehicle types and asymmetric , 1983 .

[4]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[5]  Imad Mahgoub,et al.  TrafficModeler extensions: A case for rapid VANET simulation using, OMNET++, SUMO, and VEINS , 2013, 2013 High Capacity Optical Networks and Emerging/Enabling Technologies.

[6]  Gustav Pomberger,et al.  Self-organising congestion evasion strategies using ant-based pheromones , 2010 .

[7]  Lorenzo Mussone,et al.  Ant colony optimization for stochastic user equilibrium , 2005 .

[8]  Rafidah Md Noor,et al.  A Dynamic Vehicular Traffic Control Using Ant Colony and Traffic Light Optimization , 2013, ICSS.

[9]  Víctor Yepes,et al.  Heuristic optimization of RC bridge piers with rectangular hollow sections , 2010 .

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

[11]  P. Bedi,et al.  Avoiding Traffic Jam Using Ant Colony Optimization - A Novel Approach , 2007, International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007).

[12]  Luca D'Acierno,et al.  A Stochastic Traffic Assignment Algorithm Based on Ant Colony Optimisation , 2006, ANTS Workshop.

[13]  suprascapularis V. AXILLARIS,et al.  VEINS , 1939, Springer Japan.

[14]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

[15]  Léon J. M. Rothkrantz,et al.  Travel time prediction for dynamic routing using Ant Based Control , 2009, Proceedings of the 2009 Winter Simulation Conference (WSC).

[16]  Matteo Matteucci,et al.  An ant colony system for transportation user equilibrium analysis in congested networks , 2013, Swarm Intelligence.

[17]  Matteo Matteucci,et al.  Ant colony optimization technique for equilibrium assignment in congested transportation networks , 2006, GECCO '06.

[18]  J. Deneubourg,et al.  Collective patterns and decision-making , 1989 .

[19]  Peng Wang,et al.  A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems , 2010, Appl. Soft Comput..

[20]  J. Deneubourg,et al.  Probabilistic behaviour in ants: A strategy of errors? , 1983 .

[21]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[22]  Lixiang Li,et al.  A multi-objective chaotic ant swarm optimization for environmental/economic dispatch , 2010 .

[23]  Marco Dorigo,et al.  AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..

[24]  Klaus Wehrle,et al.  Modeling and Tools for Network Simulation , 2010, Modeling and Tools for Network Simulation.

[25]  T. Koopmans,et al.  Studies in the Economics of Transportation. , 1956 .

[26]  Robert B. Dial,et al.  A PROBABILISTIC MULTIPATH TRAFFIC ASSIGNMENT MODEL WHICH OBVIATES PATH ENUMERATION. IN: THE AUTOMOBILE , 1971 .

[27]  Manuel López-Ibáñez,et al.  Beam-ACO for the travelling salesman problem with time windows , 2010, Comput. Oper. Res..

[28]  José R. Correa,et al.  Sloan School of Management Working Paper 4319-03 June 2003 Selfish Routing in Capacitated Networks , 2022 .

[29]  Léon J. M. Rothkrantz,et al.  Hierarchical Routing in Traffic Using Swarm-Intelligence , 2006, 2006 IEEE Intelligent Transportation Systems Conference.

[30]  Giulio Erberto Cantarella,et al.  A General Fixed-Point Approach to Multimode Multi-User Equilibrium Assignment with Elastic Demand , 1997, Transp. Sci..

[31]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

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

[33]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[34]  Deepak K. Merchant,et al.  A Model and an Algorithm for the Dynamic Traffic Assignment Problems , 1978 .

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

[36]  Oscar C. Au,et al.  An adaptive unsupervised approach toward pixel clustering and color image segmentation , 2010, Pattern Recognit..

[37]  Bart De Schutter,et al.  Ant Colony Routing algorithm for freeway networks , 2013 .

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

[39]  Danny Weyns,et al.  A Decentralized Approach for Anticipatory Vehicle Routing Using Delegate Multiagent Systems , 2011, IEEE Transactions on Intelligent Transportation Systems.

[40]  F. Pettersson,et al.  Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem , 2007, Appl. Math. Comput..

[41]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[42]  J. Deneubourg,et al.  How Trail Laying and Trail Following Can Solve Foraging Problems for Ant Colonies , 1990 .

[43]  Bart De Moor,et al.  Transportation Planning and Traffic Flow Models , 2005 .

[44]  Carlos F. Daganzo,et al.  On Stochastic Models of Traffic Assignment , 1977 .

[45]  Luca Maria Gambardella,et al.  AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks , 2005, Eur. Trans. Telecommun..

[46]  W. Y. Szeto,et al.  Dynamic traffic assignment: model classifications and recent advances in travel choice principles , 2012 .

[47]  Mariano Gallo,et al.  An Ant Colony Optimisation algorithm for solving the asymmetric traffic assignment problem , 2012, Eur. J. Oper. Res..

[48]  Malachy Carey,et al.  An approach to modelling time-varying flows on congested networks , 2000 .

[49]  J. Wardrop.  ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

[50]  Samuel Yagar.  Dynamic traffic assignment by individual path minimization and queuing , 1971 .