Ant Colony Optimization Based on Adaptive Volatility Rate of Pheromone Trail

Ant colony optimization (ACO) has been proved to be one of the best performing algorithms for NP-hard problems as TSP. The volatility rate of pheromone trail is one of the main parameters in ACO algorithms. It is usually set experimentally in the literatures for the application of ACO. The present paper first proposes an adaptive strategy for the volatility rate of pheromone trail according to the quality of the solutions found by artificial ants. Second, the strategy is combined with the setting of other parameters to form a new ACO method. Then, the proposed algorithm can be proved to converge to the global optimal solution. Finally, the experimental results of computing traveling salesman problems and film-copy deliverer problems also indicate that the proposed ACO approach is more effective than other ant methods and non-ant methods.

[1]  Corso Elvezia,et al.  Ant colonies for the traveling salesman problem , 1997 .

[2]  Angus R. Simpson,et al.  Parametric study for an ant algorithm applied to water distribution system optimization , 2005, IEEE Transactions on Evolutionary Computation.

[3]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[4]  Luca Maria Gambardella,et al.  Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem , 1995, ICML.

[5]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

[6]  I. Watanabe,et al.  Improving the performance of ACO algorithms by adaptive control of candidate set , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[7]  Mitsuo Gen,et al.  Film-copy deliverer problem using genetic algorithms , 1995 .

[8]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[9]  Jun Sun,et al.  A new pheromone updating strategy in ant colony optimization , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[10]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[11]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[12]  Kwang Mong Sim,et al.  Ant colony optimization for routing and load-balancing: survey and new directions , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[13]  Tony White,et al.  Using Genetic Algorithms to Optimize ACS-TSP , 2002, Ant Algorithms.

[14]  Han Huang,et al.  Solve the film-copy deliverer problem using ant colony system , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[15]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.