A New Method for Fastening the Convergence of Immune Algorithms Using an Adaptive Mutation Approach


This paper presents a new adaptive mutation approach for fastening the convergence of immune algorithms (IAs). This method is adopted to realize the twin goals of maintaining diversity in the population and sustaining the convergence capacity of the IA. In this method, the mutation rate (pm) is adaptively varied depending on the fitness values of the solutions. Solutions of high fitness are protected, while solutions with sub-average fitness are totally disrupted. A solution to the problem of deciding the optimal value of pm is obtained. Experiments are carried out to compare the proposed approach to traditional one on a set of optimization problems. These are namely: 1) an exponential multi-variable function; 2) a rapidly varying multimodal function and 3) design of a second order 2-D narrow band recursive LPF. Simulation results show that the proposed method efficiently improves IA’s performance and prevents it from getting stuck at a local optimum.

Share and Cite:

M. Abo-Zahhad, S. Ahmed, N. Sabor and A. Al-Ajlouni, "A New Method for Fastening the Convergence of Immune Algorithms Using an Adaptive Mutation Approach," Journal of Signal and Information Processing, Vol. 3 No. 1, 2012, pp. 86-91. doi: 10.4236/jsip.2012.31011.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] F. Vafaee and P. C. Nelson, “A Genetic Algorithm That Incorporates an Adaptive Mutation Based on an Evolutionary Model,” International Conference on Machine Learning and Applications, Miami Beach, 13-15 December 2009, pp. 101-107. doi:10.1109/ICMLA.2009.101
[2] W. Zhang and Y Liu, “Reactive Power Optimization Based on PSO in a practical Power System,” Proceedings of the International Multi-Conference of Engineers and Computer Scientists, Vol. 2, 2008.
[3] M. Abo-Zahhad, S. M Ahmed, N. Sabor and A. F. Al-Ajlouni, “Design of Two-Dimensional Recursive Digital Filters with Specified Magnitude and Group Delay Characteristics Using Taguchi-based Immune Algorithm,” International Journal of Signal and Imaging Systems Engineering, Vol. 3, No. 3, 2010, pp. 222-235. doi:10.1504/IJSISE.2010.038018
[4] V. Cutello, G. Nicosia, M Romeo and P. S. Oliveto, “On the Convergence of Immune Algorithm,” IEEE Symposium on Foundations of Computational Intelligence, Honolulu, 1-5 April 2007, pp. 409-415.
[5] J. T. Tsai, W. H. Ho, T. K. Liu and J. H. Chou, “Improved Immune Algorithm for Global Numerical Optimization and Job-Shop Scheduling Problems,” Applied Mathematics and Computation, Vol. 194, No. 2, 2007, pp. 406-424. doi:10.1016/j.amc.2007.04.038
[6] J. T. Tsai and J. H. Chou, “Design of Optimal Digital IIR Filters by Using an Improved Immune Algorithm,” IEEE Transactions on Signal Processing, Vol. 54, No. 12, 2006, pp. 4582-4596. doi:10.1109/TSP.2006.881248
[7] J. T. Tsai, W. H. Ho and J. H. Chou, “Design of Two-Dimensional Recursive Filters by Using Taguchi Immune Algorithm,” IET Signal Process, Vol. 2, No. 2, 2008, pp. 110-117.
[8] G. Zilong, W. Sun’an and Z. Jian, “A Novel Immune Evolutionary Algorithm Incorporating Chaos Optimization,” Pattern Recognition Letter, Vol. 27, No. 1, 2006, pp. 2-8. doi:10.1016/j.patrec.2005.06.014
[9] R. Myers and E. R. Hancock, “Genetic Algorithm Parameter Sets for Line Labelling,” Pattern Recognition Letters, Vol. 1827, No. 11, 1997, pp. 1363-1371. doi:10.1016/S0167-8655(97)00111-6
[10] R. Danchick, “Accurate Numerical Partials with Applications to Optimization,” Applied Mathematics and Computation, Vol. 183, No. 1, 2006, pp. 551-558. doi:10.1016/j.amc.2006.05.083
[11] J. T. Tsai, T. K. Liu and J. H. Chou, “Hybrid Taguchi-Genetic Algorithm for Global Numerical Optimization,” IEEE Transactions on Evolutionary Computation, Vol. 8, No. 4, 2004, pp. 365-377. doi:10.1109/TEVC.2004.826895
[12] Z. Michalewiz, “Genetic Algorithm and Data Structure,” 3rd Edition, Springer-Verlag, Berlin, 1996.
[13] M. Abo-Zahhad, S. M Ahmed, N. Sabor and A. F. Al-Ajlouni, “The Convergence Speed of Single-And Multi-Objective Immune Algorithm Based Optimization Problems,” Signal Processing: An International Journal (SPIJ), Vol. 4, No. 5, 2010, pp. 247-266.
[14] G. Ochoa, “Setting the Mutation Rate: Scope and Limitations of the 1/L Heuristic,” Proceedings of the Genetic and Evolutionary Computation Conference, Morgan Kaufmann, 9-13 July 2002, pp. 315-322.
[15] M. Srinivas and L. M. Patnaik, “Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms,” IEEE Transactions on Systems, Vol. 24, No. 4, 1994, pp. 656-667.
[16] M. Abo-Zahhad, S. M. Ahmed, N. Sabor and A. F. Al-Ajlouni, “Digital Filters Design Educational Software Based on Immune, Genetic and Quasi-Newton Line Search Algorithms,” International Journal of Innovation and Learning, Vol. 9, No. 1, 2011, pp. 35-62. doi:10.1504/IJIL.2011.037191

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.