Ant Colony Algorithm Based on Chaos Annealing

A new ant colony optimization algorithm is proposed to resolve combinatorial optimization problem. The performance of the optimization algorithm can be improved by the chaos annealing. In the incipient optimization process, ants search the new path not only according to the concentration of the pheromone, but also the chaos guidance, which make the algorithm have the stronger ergodicity searching ability. In the terminal optimization process, the chaos decayed to zero gradually. In the end, the algorithm transforms into the conventional ant colony algorithm and completes the optimal process by the principle of pheromone positive feedback, which insures the algorithm to have a quick convergence rate. The simulation results prove the validity of the algorithm.