A New Approach of Ant Colony Algorithm and Its Proof of Convergence

Ant colony optimization algorithm, which is based on bionics, has been successfully used in many fields, especially on combinatorial optimization problems. While many parameters need to be adjusted in its application, it is inconvenient for rookies. A novel ant colony optimization algorithm based on real time model is proposed and its proof of convergence is given. It is supposed that each ant´s velocity is the same and all ants are crawling in full time. Ants communicate with others by the pheromone that is left on the road. After some time the ants trail will be on the optimal route between the food and the nest. It is testified by the experiment that the novel algorithm is as well as other ant colony algorithm and it is simpler to justify the parameters than before