Ant Colony System Algorithm for Path Routing of Urban Traffic Vehicles

This paper adopts an Ant Colony System (ACS) algorithm to develop the current urban traffic vehicles path routing methods. Aiming at a goal path that both the distance and the time cost are involved into the goal function, the algorithm developed a path routing process based on an inspired heuristics searching that the next times path searching are inducted by the effective paths last times found. Through some times search, the search would be converged at the best path that deposited most pheromone. This paper analyzed the characters of the urban traffic path routing, described the searching process based on the ACS method, and presented the results that using this algorithm in a simplified urban traffic model. And based on the analysis of the computational results, this paper got a series of algorithm parameters that make the search accurate and converged quickly.