A multiple ant colonies optimization algorithm based on immunity for solving TSP

The traveling salesman problem (TSP) is a wellknown NP-hard problem and extensively studied problems in combinatorial optimization. Ant colony optimization algorithm (ACOA) has been used to solve many optimization problems in various fields of engineering. In this paper, a new algorithm was presented for solving TSP using ACOA based on immunity and multiple ant colonies. The new algorithm was tested on benchmark problems from TSPLIB and the test results were presented. The experimental results show that the new algorithm effectively relieves the tensions such as the premature, the convergence and the stagnation.

[1]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[2]  Tao,et al.  Evolutionary Computation and its Application , 2006 .

[3]  Masashi Yamada,et al.  Cooperative behavior of various agents in dynamic environment , 1997 .

[4]  Zhuhong Zhang,et al.  Immune optimization algorithm for constrained nonlinear multiobjective optimization problems , 2007, Appl. Soft Comput..

[5]  Leandro Nunes de Castro,et al.  Fundamentals of natural computing: an overview , 2007 .

[6]  Licheng Jiao,et al.  A novel genetic algorithim based on immunity , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[7]  Licheng Jiao,et al.  A novel genetic algorithm based on immunity , 2000, IEEE Trans. Syst. Man Cybern. Part A.

[8]  Paul H. Calamai,et al.  Exchange strategies for multiple Ant Colony System , 2007, Inf. Sci..

[9]  G. Di Caro,et al.  Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[10]  Hartmut Schmeck,et al.  Multi Colony Ant Algorithms , 2002, J. Heuristics.