A hybrid memetic algorithm for global optimization

A hybrid memetic algorithm, called a memetic algorithm with double mutation operators (MADM), is proposed to deal with the problem of global optimization. In this paper, the algorithm combines two meta-learning systems to improve the ability of global and local exploration. The double mutation operators in our algorithms guide the local learning operator to search the global optimum; meanwhile the main aim is to use the favorable information of each individual to reinforce the exploitation with the help of two meta-learning systems. Crossover operator and elitism selection operator are incorporated into MADM to further enhance the ability of global exploration. In the first part of the experiments, six benchmark problems and six CEC2005@?s problems are used to test the performance of MADM. For the most problems, the experimental results demonstrate that MADM is more effective and efficient than other improved evolutionary algorithms for numerical optimization problems. In the second part of the experiments, MADM is applied to a practical problem, clustering complex and linearly non-separable datasets, with a satisfying result.

[1]  Aristidis Likas,et al.  The Global Kernel $k$-Means Algorithm for Clustering in Feature Space , 2009, IEEE Transactions on Neural Networks.

[2]  Jing J. Liang,et al.  Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization , 2005 .

[3]  Wei Hou,et al.  Evolutionary programming using a mixed mutation strategy , 2007, Inf. Sci..

[4]  D. Quagliarella,et al.  Airfoil and wing design through hybrid optimization strategies , 1998 .

[5]  C. Houck,et al.  Utilizing Lamarckian Evolution and the Baldwin Effect in Hybrid Genetic Algorithms , 2007 .

[6]  Domenico Quagliarella,et al.  Airfoil and wing design through hybrid optimization strategies , 1998 .

[7]  Licheng Jiao,et al.  Lamarkian Clonal Selection Algorithm for CDMA Multiuser Detection over Multi-Path Channels , 2005, 2005 International Conference on Neural Networks and Brain.

[8]  Andy J. Keane,et al.  Meta-Lamarckian learning in memetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

[9]  Amit Konar,et al.  Differential Evolution Using a Neighborhood-Based Mutation Operator , 2009, IEEE Transactions on Evolutionary Computation.

[10]  Jean-Michel Renders,et al.  Hybridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[11]  Sigeru Omatu,et al.  Efficient Genetic Algorithms Using Simple Genes Exchange Local Search Policy for the Quadratic Assignment Problem , 2000, Comput. Optim. Appl..

[12]  Joshua D. Knowles,et al.  An Evolutionary Approach to Multiobjective Clustering , 2007, IEEE Transactions on Evolutionary Computation.

[13]  Kumar Chellapilla,et al.  Combining mutation operators in evolutionary programming , 1998, IEEE Trans. Evol. Comput..

[14]  Dan Liu,et al.  Immune Clonal Selection Optimization Method with Mixed Mutation Strategies , 2007, 2007 Second International Conference on Bio-Inspired Computing: Theories and Applications.

[15]  J. A. Hartigan,et al.  A k-means clustering algorithm , 1979 .

[16]  Bernhard Sendhoff,et al.  Lamarckian memetic algorithms: local optimum and connectivity structure analysis , 2009, Memetic Comput..

[17]  Amit Konar,et al.  Differential Evolution with Local Neighborhood , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[18]  Amit Konar,et al.  Automatic kernel clustering with a Multi-Elitist Particle Swarm Optimization Algorithm , 2008, Pattern Recognit. Lett..

[19]  Gang Chen,et al.  Preserving and Exploiting Genetic Diversity in Evolutionary Programming Algorithms , 2009, IEEE Transactions on Evolutionary Computation.

[20]  Nikolaus Hansen,et al.  Evaluating the CMA Evolution Strategy on Multimodal Test Functions , 2004, PPSN.

[21]  M. J. D. Powell,et al.  Direct search algorithms for optimization calculations , 1998, Acta Numerica.

[22]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[23]  Xin Jin,et al.  K-Means Clustering , 2010, Encyclopedia of Machine Learning.

[24]  Fang Liu,et al.  Lamarckian Learning in Clonal Selection Algorithm for Numerical Optimization , 2010, Int. J. Artif. Intell. Tools.

[25]  Xin Yao,et al.  Evolutionary programming using mutations based on the Levy probability distribution , 2004, IEEE Transactions on Evolutionary Computation.

[26]  Bernhard Schölkopf,et al.  Nonlinear Component Analysis as a Kernel Eigenvalue Problem , 1998, Neural Computation.

[27]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .