doi: 10.4304//jsw.4.9.976-983
An Improved Clonal Algorithm in Multiobjective Optimization
- Department of Computer Science and Technology, Shenzhen University, Shenzhen, P.R. China
Abstract
In this paper, we develop a novel clonal algorithmfor multiobjective optimization (NCMO) which is improvedfrom three approaches, i.e., dynamic mutation probability,dynamic simulated binary crossover (D-SBX) operator andhybrid mutation operator combining with Gaussian andpolynomial mutations (GP-HM operator). Among them, theGP-HM operator is controlled by the dynamic mutationprobability. These approaches adopt a cooling schedule,reducing the parameters gradually to a minimal threshold.By this means, they can enhance exploratory capabilities,and keep a desirable balance between global search andlocal search, so as to accelerate the convergence speed to thetrue Pareto-optimal front. When comparing NCMO withvarious state-of-the-art multiobjective optimizationalgorithms developed recently, simulation results show thatNCMO evidently has better performance.
Keywords
- multiobjective
- optimization;
- immunealgor
How to Cite
Jianyong Chen, Qiuzhen Lin, and Qingbin Hu, "An Improved Clonal Algorithm in Multiobjective Optimization," Journal of Software, vol. 4, no. 9, pp. 976-983, 2009. https://doi.org/ 10.4304//jsw.4.9.976-983
Copyright & License
Copyright © 2009 by the authors. 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 (CC BY 4.0).
