Coevolving memetic algorithms: a review and progress report.
Coevolving memetic algorithms are a family of metaheuristic search algorithms in which a rule-based representation of local search (LS) is coadapted alongside candidate solutions within a hybrid evolutionary system. Simple versions of these systems have been shown to outperform other nonadaptive memetic and evolutionary algorithms on a range of problems. This paper presents a rationale for such systems and places them in the context of other recent work on adaptive memetic algorithms. It then proposes a general structure within which a population of LS algorithms can be evolved in tandem with the solutions to which they are applied. Previous research started with a simple self-adaptive system before moving on to more complex models. Results showed that the algorithm was able to discover and exploit certain forms of structure and regularities within the problems. This "metalearning" of problem features provided a means of creating highly scalable algorithms. This work is briefly reviewed to highlight some of the important findings and behaviors exhibited. Based on this analysis, new results are then presented from systems with more flexible representations, which, again, show significant improvements. Finally, the current state of, and future directions for, research in this area is discussed.
Smith
Jim E
JE
Faculty of Computing, Engineering, and Mathematical Sciences, University of the West of England, BS16 12QY Bristol, U.K. james.smith@uwe.ac.uk
D000465:Algorithms; D001185:Artificial Intelligence; D032701:Biomimetics / Q000379:methods* / Q000639:trends*; D003198:Computer Simulation / Q000639:trends*; D008957:Models, Genetic; D012984:Software / Q000639:trends*; D013598:Systems Theory