Converse ant algorithm basis of adjust information element hangover coefficient

Ant colony algorithm is a novel category of bionic parallel and intelligence system.It has many promising futures.However it has some shortcomings such as needing much time and easier occurring of stagnation behavior.This paper basis of converse ants algorithm use adapt adjust information element hangover coefficient,the ability of searching for global optimal solution can be improved.The algorithm can solve the traveling salesman problem,the results show that the ability of optimization and convergence speed have improved.