Study on Immunized Ant Colony Optimization

  • Authors:
  • Wei Gao

  • Affiliations:
  • Wuhan Polytechnic University, China

  • Venue:
  • ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 04
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Ant Colony Optimization (ACO) is a new natural computation method from mimic the behaviors of ant colony.It is a very good combination optimization method. To extend the ant colony optimization, some continuous Ant Colony Optimizations have been proposed. To improve the searching performance, the principles of evolutionary algorithm and artificial immune algorithm have been combined with the typical continuous Ant Colony Optimization, and one new Immunized Ant Colony Optimization is proposed here. In this new algorithm, the ant individual is transformed by adaptive Cauchi mutation and thickness selection. To verify the new algorithm, the typical functions, such as Schaffer function and "Needle-in-a-haystack" function, are all used. And then, the results of Immunized Ant Colony Optimization are compared with that of continuous Ant Colony Optimization. The results show that, the convergent speed and computing precision of new algorithm are all very good.