Avoiding Traffic Jam Using Ant Colony Optimization - A Novel Approach

Ant colony optimization (ACO) is a meta-heuristic based on colony of artificial ants which work cooperatively, building solutions by moving on the problem graph and by communicating through artificial pheromone trails mimicking real ants. One of the active research directions is the application of ACO algorithms to solve dynamic shortest path problems. Solving traffic jams is one such problem where the cost i.e. time to travel increases during rush hours resulting in tremendous strain on daily commuters and chaos. This paper describes a new approach-DSATJ (Dynamic System for Avoiding Traffic Jam) which aims at choosing an alternative optimum path to avoid traffic jam and then resuming that same path again when the traffic is regulated. The approach is inspired by variants of ACO algorithms. Traffic jam is detected through pheromone values on edges which are updated according to goodness of solution on the optimal tours only. Randomness is introduced in the probability function to ensure maximum exploration by ants. Experiments were carried out with the partial road map of North-West region of Delhi, India, to observe the performance of our approach.

[1]  Michael Isard,et al.  CONDENSATION—Conditional Density Propagation for Visual Tracking , 1998, International Journal of Computer Vision.

[2]  Barbara Webb,et al.  Swarm Intelligence: From Natural to Artificial Systems , 2002, Connect. Sci..

[3]  Gunilla Borgefors,et al.  Hierarchical Chamfer Matching: A Parametric Edge Matching Algorithm , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[5]  S. Haykin,et al.  Adaptive Filter Theory , 1986 .

[6]  Zhang Subing,et al.  Distributed dynamic routing using ant algorithm for telecommunication networks , 2000, WCC 2000 - ICCT 2000. 2000 International Conference on Communication Technology Proceedings (Cat. No.00EX420).

[7]  C. J. Eyckelhof,et al.  Ant Systems for a Dynamic TSP - Ants Caught in a Traffic Jam , 2002 .

[8]  Andrew Calway,et al.  Real-Time Camera Tracking Using a Particle Filter , 2005, BMVC.

[9]  Joong Soo Ma,et al.  Mobile Communications , 2003, Lecture Notes in Computer Science.

[10]  T. Stützle,et al.  A Review on the Ant Colony Optimization Metaheuristic: Basis, Models and New Trends , 2002 .

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

[12]  T. Lee Theory and application of adaptive fading memory Kalman filters , 1988 .

[13]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[14]  B. Bullnheimer,et al.  A NEW RANK BASED VERSION OF THE ANT SYSTEM: A COMPUTATIONAL STUDY , 1997 .

[15]  Daniel Angus The Current State of Ant Colony Optimisation Applied to Dynamic Problems , 2006 .

[16]  Tim Hendtlass,et al.  Dynamic Ant Colony Optimisation , 2005, Applied Intelligence.

[17]  Deva K. Borah,et al.  Frequency-selective fading channel estimation with a polynomial time-varying channel model , 1999, IEEE Trans. Commun..

[18]  Leonard J. Cimini,et al.  Analysis and Simulation of a Digital Mobile Channel Using Orthogonal Frequency Division Multiplexing , 1985, IEEE Trans. Commun..

[19]  Björn Stenger,et al.  Shape context and chamfer matching in cluttered scenes , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..