- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
Applied Computational Intelligence and Soft Computing
Volume 2011 (2011), Article ID 210918, 8 pages
Design of Fixed and Ladder Mutation Factor-Based Clonal Selection Algorithm for Solving Unimodal and Multimodal Functions
1Anil Neerukonda Institute of Technology and Sciences, Visakhapatnam, Andhra Pradesh, India
2Gitam University, Visakhapatnam, India
3Andhra University Engineering College, Visakhapatnam, Andhra Pradesh, India
Received 6 May 2011; Accepted 14 July 2011
Academic Editor: Maoguo Gong
Copyright © 2011 Suresh Chittineni et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Clonal selection algorithms (CSAs) is a special class of immune algorithms (IA), inspired by the clonal selection principle of the human immune system. To improve the algorithm's ability to perform better, this CSA has been modified by implementing two new concepts called fixed mutation factor and ladder mutation factor. Fixed mutation factor maintains a constant factor throughout the process, where as ladder mutation factor changes adaptively based on the affinity of antibodies. This paper compared the conventional CLONALG, with the two proposed approaches and tested on several standard benchmark functions. Experimental results empirically show that the proposed methods ladder mutation-based clonal selection algorithm (LMCSA) and fixed mutation clonal selection algorithm (FMCSA) significantly outperform the existing CLONALG method in terms of quality of the solution, convergence speed, and solution stability.
Artificial Immune System (AIS) is one of the bioinspired approaches for solving the real complex and difficult optimization problems. The AIS is greatly reinforced by the human immune system. In humans, the immune system is responsible for protection from pathogens. De Castro and von Zuben proposed a clonal selection algorithm (CSA) based on the clonal selection principle and the affinity maturation process . CLONALG (clonal algorithm) is an artificial immune algorithm  based on clonal selection principle. CLONALG is used to optimize functions . CLONALG has global searching ability as it uses the principle of clonal expansion and affinity maturation as the main forces of the evolutionary process.
In this paper, we present an improved version of the immune system model based on the clonal selection theory. Two algorithms LMCSA (ladder mutation factor-based clonal selection algorithm) and FMCSA (fixed mutation factor-based clonal selection algorithm) are proposed by introducing two novel immune mutation factors and are applied to unimodal and multimodal functions optimizations. The results illustrate that the proposed algorithms have a remarkable performance over basic CLONALG.
The remainder of this paper is organized as follows. Section 2 briefly discusses the basic steps in clonal selection optimization algorithm (CLONALG) and antibody diversity maintaining principles. Section 3 describes our modified versions of immune optimization algorithm with the introduction of mutation factor and its details. Section 4 gives further explanations, experimental analysis, simulation results to several benchmark problems, and comparisons of our proposed algorithms with the conventional CLONALG. Section 5 concludes our paper with some remarks and conclusions.
2. Basic Immune Optimization Algorithm (CLONALG)
CLONALG is a population-based metaheuristic algorithm whose search power relies on its mutation operator. In our proposed work the main thrust is given to these mutation operators while developing better algorithms. The clonal selection algorithm (CSA) reproduces individuals with high affinities and selects improved maturate progenies. This strategy suggests that this algorithm performs a greedy search, where single members will be locally optimized, and the newcomers yield a broader exploration of the search space. This characteristic makes the CSA very suitable for solving optimization tasks. The basic steps and working of immune optimization algorithm (CLONALG) is described as follows.
Step 1 (antibody pool (AB) initialization). Initially, an Antibody Pool (AB) is created with antibodies chosen randomly in the search space. Antibodies are represented by the variables of the problem () which are potential solutions to the problem.
Step 2 (selection). For each antibody (), its corresponding affinity is determined. These antibodies are then sorted according to the affinity calculated. And antibodies are selected having the highest affinity.
Step 3 (cloning). Cloning is one of the key aspects in AIS. It is the process of producing similar populations of genetically identical individuals. The best selected antibodies will be replicated in proportionate to their antigenic affinity. The replicated antibodies, that is, clones, are maintained as a separate clone population . The number of clones for each antibody can be calculated by the following equation: where is the total number of clones  generated, is a multiplying factor, is the size of Antibody Pool (AB), and round () is the operator that rounds its argument towards the closest integer. Clone size of each selected antibody is represented by each term of this sum. The higher the affinity, the higher the number of clones generated for the selected antibody .
Step 4 (affinity mutation). The clone population is now subjected to mutation process which is inversely proportional to its antigenic affinity measurement function. This mutation helps for low-affinity antibodies to mutate more in order to improve its affinity. The mutations always result in better-affinity antibodies. For Gray’s coding, uniform mutation, the Gaussian mutation or Cauchy’s mutation can be used. In this Paper, self-adaptive mutation using the Gaussian distribution is used for making a search in the area surrounding the cell with high probability. And it has an outstanding ability of both local and global searching. The Gaussian mutation operator  can be described as follows:
where , , . The parameter is the mutation step of antibody , and are the whole step and the individual step, respectively.
Then, the affinities of the mutated clones are calculated. The better-affinity mutations are stimulated while the worse are restrained when antibody undergoes affinity mutation. The higher affinity values are taken for next generation while the Lower-affinity antibodies are deleted.
Step 5 (antibody diversity maintenance). Inspired by the vertebrate immune system mechanism called antibodies restraint, the processes of suppression and supplementation are defined in CLONALG. This step maintains diversity and helps to find new solutions that correspond to new search regions by eliminating some percentage of the worst antibodies in the population and replacing with the randomly generated new antibodies. This helps the algorithm to avoid being trapped to local optimal solutions. In antibodies restraint , for every iteration, the similar antibodies are removed, and randomly generated antibodies are introduced in the place of removed antibody of the Antibody Pool (AB).
The pseudocode of antibody restraint’s redundancy removal is explained below for better clarity.
Step 1. For every antibody, affinity is computed and then sorted based on affinity values in descending order. Let an antibody vector be Pop; is the total number of antibody in generation.
Step 2. Set , Repeat:Checking: Is AB() and AB() Similar or not? If AB() is similar with AB() Delete AB() in population Else End if Until .
Step 3. If number of the antibodies <
Add new antibodies to AB.
Step 6 (convergence check). Repeat Steps 2 to 5, until the following conditions are met.(i)Algorithm undergoes a specified number of iterations.(ii)The optimal solutions in memory cells are not improved in given generations.
3. Proposed Fixed Mutation Factor- and Ladder Mutation Factor-Based Clonal Selection Algorithm (FMCSA and LMCSA)
In the basic CLONALG, the initially best and worst antibodies are identified; the process of cloning is applied to both the best and the worst antibodies such that cloning rate is high to the best antibodies and less to the worst antibodies . Therefore, more clones are produced for the antibody that has the highest affinity. Further, the worst antibodies are mutated in order to make them better. By doing this, the worst antibodies can improve; however, no care is taken for the best antibodies. Since more population of the best antibodies also exist in that pool, there is a chance of faster convergence if best antibodies are also taken care properly. Otherwise, these can lead to local optima and the low convergence rate, resulting in poor performance of the algorithm.
In this paper, two novel methods are introduced to solve this problem by properly nurturing the best antibodies. The basic flowchart for these methods is given in Figure 1.
(A) Fixed Mutation Factor-Based Clonal Selection Algorithm (FMCSA)
Like in CLONALG, the best antibody is cloned according to the cloning rate (), and clones of best antibodies are generated. In this process, mutation is done to some of the best antibodies also along with the worst antibodies. A few percentages of best antibodies that are cloned are taken and are mutated along with the worst antibodies. So, a fixed mutation factor is defined as the percentage of the best cloned antibodies in clone population () that are to be considered for mutation. This mutation factor is fixed throughout the process. The number of the best antibodies to be considered for mutation in each antibody’s clone population (CMUTAB) is calculated as follows: where CMUTAB is the number of the best antibodies to be considered for mutation in each antibody’s clone population. is the fixed mutation factor, is the total number of antibodies in each clone population of an antibody, and Ceil() is the operator that rounds its argument towards the nearest integers.
For example, for 5 initial antibodies after performing Steps from 1 to 3, let the clone population be (5,4,3,2,1). Let the fixed mutation factor be 0.3. So, upon using (3), CMUTAB = 2. Hence, 2 best antibodies are considered out of 5 initial cloned antibodies for mutation. As the worst antibodies are having less antigenic affinity, they are cloned less in number as in basic CLONALG . In general, for FMCSA algorithm, the fixed mutation factor is chosen to be very small.
(B) Ladder Mutation Factor-Based Clonal Selection Algorithm (LMCSA)
In the fixed mutation factor approach, the mutation factor remains constant. When the affinity difference between the worst antibody and the best antibody is high, then the worst antibodies try to go and follow the best as in any other evolutionary strategies. But, when their affinity difference is very less, all the worst and the best antibodies are in the same surrounding area of the search space, or, in other words, the worst antibody has come closer to the best antibody’s area . At this time, the further improvement may not achieve at faster rate. This can be enhanced by considering few additional antibodies for mutation. A chance of better convergence can be attained by adaptively incrementing the percentage of best cloned antibodies for mutation as explained in Figure 2. The mutation factor can be incremented adaptively based on the affinity measure. This mutation factor is proportional to the affinity of the antibodies; that is, if the ratio of the affinities between the best and worst antibody is less than the threshold value , then mutation factor should be incremented.
The following pseudocode is included in Step 4 of the basic CLONALG:
If is a parameter, changed dynamically as follows: End
where is the threshold value. is the best antibody in the Antibody Pool. is the worst antibody in the Antibody Pool. t5 constant multiplier depends on the problem type. is the mutation factor. iter stands for current iteration. maxiter stands for maximum number of iterations. is a function used for calculating the affinity of the antibody.
4. Benchmark Test Functions: Results and Analysis
(A) Benchmark Functions for Simulation
A suite of twelve standard and well-known benchmark functions [6, 7, 9, 10] are taken into consideration to test the effectiveness and the efficiencies of the proposed approaches FMCSA and LMCSA with the basic CLONALG. All these benchmark functions are meant to be minimized. The mentioned benchmark test functions cover different kinds of optimization problems. They can be divided into two categories. The first one is the category of the unimodal function, which is a symmetric model with a single minimum; in Table 1, are unimodal functions. The functions in Table 1 belong to the category of multimodal functions with many local minima.
(B) Experimental Setup
The approaches that are described earlier have been coded using the MATLAB Scripting language, and all experiments took place on a 1.8 GHz Intel Core 2 Duo processor, 2 GB of RAM, and on Windows XP operating system. Each algorithm is evaluated for 1000 iterations as the termination criteria.
The following simulation conditions are used.(i)Initial population or Antibody Pool Size, . (ii)Clone multiplying factor’s range .(iii) Type of mutation used: Gaussian.(iv)Gaussian mutation probability .(v)Percentage of suppression .(vi)The affinity threshold .(vii)Number of iterations = 1000.(viii)Fixed mutation factor in .(ix) and varies from the problem’s domain range.(x)Number of dimensions taken for each Benchmark function = 10.
(C) Benchmark Results and Analysis
In this section, the results for the 12 benchmark test functions are given to show the merits of the proposed FMCSA and LMCSA. The experimental results in terms of the mean affinity value, the best cost value, and the standard deviation are summarized in Table 2, and Figures 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, and 14 give the performance curves for each function. The analyses of results are done category-wise as presented below.
Category 1 (unimodal functions)
The main purpose of testing these functions from to is to measure the convergence rate of searching. For these functions, the results in terms of the mean affinity values of the LMCSA are much better than that of FMCSA and the conventional CLONALG. However, FMCSA outperforms CLONALG. The lower standard deviation values in LMCSA show the stability of the algorithm. It can be verified from performance curves given in Figures 3 to 9 that LMCSA has a very fast rate of convergence to solution compared to FMCSA and CLONALG algorithms. For the function , both FMCSA and LMCSA performed similarly.
Category 2 (multimodal functions with many local minima)
For these kinds of functions, more chances are there for being easily trapped at some local minimum. Functions are multimodal functions with many local minima. The experimental results for these functions are tabulated in Table 2. It can be clearly seen from Table 2 and from Figures 10 to 14 that the results in terms of the mean affinity values, standard deviation, and convergence rate of the LMCSA are much better than those of the proposed method FMCSA and the conventional CLONALG. And the results obtained from FMCSA are better than CLONALG in all cases. For the function , both FMCSA and LMCSA perform similarly.
In this paper, we proposed two novel approaches, fixed mutation clonal selection algorithm (FMCSA) and ladder mutation clonal selection algorithm (LMCSA). Our objective is to increase the searching area by increasing a few numbers of antibodies that undergo mutation so as to further improve the performance of basic CLONALG. On solving a suite of benchmark functions, FMCSA performs better than CLONALG, and LMCSA outperforms both FMCSA and CLONALG. Simulation results on standard benchmark problems have shown that the proposed methods are useful techniques to solve complex optimization problems.
- L. N. de Castro and F. J. von Zuben, “Learning and optimization using the clonal selection principle,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 3, pp. 239–251, 2002.
- X. Xuesong and Z. Jing, “An improved immune evolutionary algorithm for multimodal function optimization,” in Proceedings of the 3rd International Conference on Natural Computation (ICNC '07), pp. 641–646, August 2007.
- N. Cruz-Cortés, D. Trejo-Pérez, and C. A. Coello Coello, “Handling constraints in global optimization using an artificial immune system,” in Proceedings of the 4th International Conference on Artificial Immune Systems (ICARIS '05), pp. 234–247, August 2005.
- L. N. de Castro and J. Timmis, An Introduction to Artificial Immune Systems: A New Computational Intelligence Paradigm, Springer, 2002.
- L. Pan and Z. Fu, “A clonal selection algorithm for open vehicle routing problem,” in Proceedings of the 3rd International Conference on Genetic and Evolutionary Computing (WGEC '09), pp. 786–790, October 2009.
- S. H. Ling, H. H. C. Iu, K. Y. Chan, H. K. Lam, B. C. W. Yeung, and F. H. Leung, “Hybrid particle swarm optimization with wavelet mutation and its industrial applications,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 38, no. 3, pp. 743–763, 2008.
- J. J. Liang, A. K. Qin, P. N. Suganthan, and S. Baskar, “Comprehensive learning particle swarm optimizer for global optimization of multimodal functions,” IEEE Transactions on Evolutionary Computation, vol. 10, no. 3, pp. 281–295, 2006.
- J. Timmis, C. Edmonds, and J. Kelsey, “Assessing the performance of two immune inspired algorithms and a hybrid genetic algorithm for function optimisation,” in Proceedings of the 2004 Congress on Evolutionary Computation (CEC '04), pp. 1044–1051, June 2004.
- K. A. Al-Sheshtawi, H. M. Abdul-Kader, and N. A. Ismail, “Artificial immune clonal selection algorithms: a comparative study of CLONALG, opt-IA, and BCA with numerical optimization problems,” International Journal of Computer Science and Network Security, vol. 10, no. 4, pp. 24–30, 2010.
- J. Zhang and A. C. Sanderson, “JADE: adaptive differential evolution with optional external archive,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 5, pp. 945–958, 2009.