Meta-Lamarckian Learning in Memetic Algorithms
Top Cited Papers
- 19 April 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 8 (2), 99-110
- https://doi.org/10.1109/tevc.2003.819944
Abstract
Over the last decade, memetic algorithms (MAs) have relied on the use of a variety of different methods as the local improvement procedure. Some recent studies on the choice of local search method employed have shown that this choice significantly affects the efficiency of problem searches. Given the restricted theoretical knowledge available in this area and the limited progress made on mitigating the effects of incorrect local search method choice, we present strategies for MA control that decide, at runtime, which local method is chosen to locally improve the next chromosome. The use of multiple local methods during a MA search in the spirit of Lamarckian learning is here termed Meta-Lamarckian learning. Two adaptive strategies for Meta-Lamarckian learning are proposed in this paper. Experimental studies with Meta-Lamarckian learning strategies on continuous parametric benchmark problems are also presented. Further, the best strategy proposed is applied to a real-world aerodynamic wing design problem and encouraging results are obtained. It is shown that the proposed approaches aid designers working on complex engineering problems by reducing the probability of employing inappropriate local search methods in a MA, while at the same time, yielding robust and improved design search performance.Keywords
This publication has 18 references indexed in Scilit:
- Local evolutionary search enhancement by random memorizingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Adaptation in evolutionary computation: a surveyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Multimeme Algorithms for Protein Structure PredictionLecture Notes in Computer Science, 2002
- A domain knowledge based search advisor for design problem solving environmentsEngineering Applications of Artificial Intelligence, 2002
- Aircraft wing design using GA-based multi-level strategiesPublished by American Institute of Aeronautics and Astronautics (AIAA) ,2000
- Operator and parameter adaptation in genetic algorithmsSoft Computing, 1997
- No free lunch theorems for optimizationIEEE Transactions on Evolutionary Computation, 1997
- Genetic algorithm optimization of multi-peak problems: studies in convergence and robustnessArtificial Intelligence in Engineering, 1995
- Quadratic OptimizationPublished by Springer Nature ,1995
- A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear InterpolationPublished by Springer Nature ,1994