Computational Optimization and Applications
Differential evolution using a neighborhood-based mutation operator
IEEE Transactions on Evolutionary Computation
Preserving and exploiting genetic diversity in evolutionary programming algorithms
IEEE Transactions on Evolutionary Computation
Combining mutation operators in evolutionary programming
IEEE Transactions on Evolutionary Computation
Evolutionary programming using mutations based on the Levy probability distribution
IEEE Transactions on Evolutionary Computation
Meta-Lamarckian learning in memetic algorithms
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
A memetic algorithm with double mutation operators is proposed, termed as MADM. 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. MADM is compared with the algorithms LCSA, DELG and CMA-ES on some benchmark problems and CEC2005's problems. For the most problems, the experimental results demonstrate that MADM are more effective and efficient than LCSA, DELG and CMA-ES in solving numerical optimization problems.