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

has been cited by the following article:

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

  AUTHORS: Mohammed Abo-Zahhad, Sabah M. Ahmed, Nabil Sabor, Ahmad F. Al-Ajlouni

  KEYWORDS: Adaptive Mutation; Immune Algorithm; Convergence; Traditional Mutation

  JOURNAL NAME: Journal of Signal and Information Processing, Vol.3 No.1, February 29, 2012

  ABSTRACT: 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.