Clonal Selection Algorithm with Adaptive Mutation and Roulette Wheel Selection

In this paper, roulette wheel selection strategy and adaptive mutation operation were introduced to the basic immune clonal selection algorithm (ICSA) in order to overcome premature convergence and stagnation at the end stage of iterative optimization. The method was utilized to optimize two types of typical testing functions and the simulation results show that the algorithm can improve the ability of searching the global optimum and yield superior results compared with the basic immune clonal selection algorithm.

[1]  Gregg H. Gunsch,et al.  An artificial immune system architecture for computer security applications , 2002, IEEE Trans. Evol. Comput..

[2]  Leandro Nunes de Castro,et al.  The Clonal Selection Algorithm with Engineering Applications 1 , 2000 .

[3]  Maoguo Gong,et al.  Adaptive Dynamic Clone Selection Algorithms , 2004, Rough Sets and Current Trends in Computing.

[4]  D. Dasgupta,et al.  Immunity-based systems: a survey , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[5]  Song-Yop Hahn,et al.  A study on comparison of optimization performances between immune algorithm and other heuristic algorithms , 1998 .

[6]  John H. Holland.  Genetic Algorithms and Classifier Systems: Foundations and Future Directions , 1987, ICGA.

[7]  Yanjun Li,et al.  A novel immune algorithm for complex optimization problems , 2004, Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).

[8]  Guan-Chun Luh,et al.  Immune model-based fault diagnosis , 2005, Math. Comput. Simul..

[9]  John E. Hunt,et al.  Learning using an artificial immune system , 1996 .