Data-Driven Adaptation in Memetic Algorithms
As has been empirically demonstrated in the previous chapter, an inattentively configured combination of memetics and a base evolutionary algorithm (EA) can potentially lead to below par optimization performance. The typical issues that must be addressed in the design of such memetic algorithms (MAs), often requiring some degree of domain expertise or extensive human intervention in the tuning of control parameters, include, (i) finding the subset of solutions for which local refinements must be carried out, (ii) determining local search intensity (i.e., the computational budget to be allocated for lifetime learning of individuals in the MA), and (iii) defining the lifetime learning method, i.e., meme, to be used for a particular problem at hand given a catalogue of multiple memes (multi-memes) to choose from. In this chapter, we offer a data-driven alternative to tackling some of these issues.
- 3.Cowling, P., Kendall, G., & Soubeiga, E. (2000). A hyperheuristic approach to scheduling a sales summit. In International Conference on the Practice and Theory of Automated Timetabling (pp. 176–190). Berlin, Heidelberg: Springer.Google Scholar
- 4.Ong, Y. S., Lim, M. H., Zhu, N., & Wong, K. W. (2006). Classification of adaptive memetic algorithms: A comparative study. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 36(1), 141–152.Google Scholar
- 11.Dawkins, R. (1976). The selfish gene. Oxford: Oxford University Press.Google Scholar
- 12.Blackmore, S. (2000). The meme machine (Vol. 25). Oxford Paperbacks.Google Scholar
- 18.Baluja, S. (2017). Deep learning for explicitly modeling optimization landscapes. arXiv preprint arXiv:1703.07394.