Time-dependent pheromones and electric-field model: a new ACO algorithm for dynamic traffic routing Online publication date: Fri, 31-Dec-2010
by Biao-bin Jiang, Han-ming Chen, Li-na Ma, Lei Deng
International Journal of Modelling, Identification and Control (IJMIC), Vol. 12, No. 1/2, 2011
Abstract: In this paper, we present a dynamic ant colony optimisation (ACO) algorithm to solve dynamic traffic routing problem. The main objective of this work is to search out the least-time-cost route in a variable-edge-weight graph. We introduce time-dependent pheromones and electric-field model as two heuristic factors to improve the basic ACO. The simulation results show that the proposed dynamic ACO algorithm can effectively reduce time cost by avoiding the dynamic congestion areas. Finally, this proposed heuristic algorithm is verified to be steady-going by repeated testing.
Online publication date: Fri, 31-Dec-2010
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Modelling, Identification and Control (IJMIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org