Author： Jiang Biao-bin Chen Han-ming Ma Li-na Deng Lei
Publisher： Inderscience Publishers
ISSN： 1746-6172
Source： International Journal of Modelling, Identification and Control, Vol.12, Iss.1-2, 2011-12, pp. : 29-35
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
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.
Access to resources
Recommend
