A Kind of Ant Colony Algorithm with Route Evaluation

ABSTRACT

Ant algorithm is a novel meta-heuristic optimization algorithm, but at the same time there are some disadvantages. This paper proposed an ant colony algorithm with route evaluation based on the basic ant colony algorithm. After all ant complete the route search once, the current search situation can be evaluated according to an improved formula of standard deviation, then to decide to update global pheromone or not. At the same time, via the function of interval compression, the pheromone of all routes is compressed to adjust the searching probability of ants to each city. Experimental results show that this improved algorithm has more excellent presentation on convergence, searching optimization, and stability.

Keywords: