Hybrid ant colony algorithm for traveling salesman problem

Abstract A hybrid approach based on ant colony algorithm for the traveling salesman problem is proposed, which is an improved algorithm characterized by adding a local search mechanism, a cross-removing strategy and candidate lists. Experimental results show that it is competitive in terms of solution quality and computation time.

[1]  Marco Dorigo,et al.  An Investigation of some Properties of an "Ant Algorithm" , 1992, PPSN.

[2]  Luca Maria Gambardella,et al.  Solving symmetric and asymmetric TSPs by ant colonies , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

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

[4]  Walter J. Gutjahr,et al.  A Graph-based Ant System and its convergence , 2000, Future Gener. Comput. Syst..