Estimating meme fitness in adaptive memetic algorithms for combinatorial problems
Estimating meme fitness in adaptive memetic algorithms for combinatorial problems.
Evolutionary Computation, 20 (2).
Available from: http://eprints.uwe.ac.uk/17617
- Published Version
Publisher's URL: http://dx.doi.org/10.1162/EVCO_a_00060
Among the most promising and active research areas in heuristic optimisation is the field of adaptive memetic algorithms (AMAs). These gain much of their reported robustness by adapting the probability with which each of a set of local improvement operators is applied, according to an estimate of their current value to the search process. This paper addresses the issue of how the current value should be estimated. Assuming the estimate occurs over several applications of a meme, we consider whether the extreme or mean improvements should be used, and whether this aggregation should be global, or local to some part of the solution space. To investigate these issues, we use the well-established COMA framework that coevolves the specification of a population of memes (representing different local search algorithms) alongside a population of candidate solutions to the problem at hand. Two very different memetic algorithms are considered: the first using adaptive operator pursuit to adjust the probabilities of applying a fixed set of memes, and a second which applies genetic operators to dynamically adapt and create memes and their functional definitions. For the latter, especially on combinatorial problems, credit assignment mechanisms based on historical records, or on notions of landscape locality, will have limited application, and it is necessary to estimate the value of a meme via some form of sampling. The results on a set of binary encoded combinatorial problems show that both methods are very effective, and that for some problems it is necessary to use thousands of variables in order to tease apart the differences between different reward schemes. However, for both memetic algorithms, a significant pattern emerges that reward based on mean improvement is better than that based on extreme improvement. This contradicts recent findings from adapting the parameters of operators involved in global evolutionary search. The results also show that local reward schemes outperform global reward schemes in combinatorial spaces, unlike in continuous spaces. An analysis of evolving meme behaviour is used to explain these findings.
|Uncontrolled Keywords:||estimating meme fitness, adaptive memetic algorithms, combinatorial problems|
Professor J. Smith
|Deposited On:||02 Nov 2012 15:52|
|Last Modified:||28 Mar 2016 14:59|
Request a change to this item
Total Document Downloads in Past 12 Months