<abstract xmlns="http://www.w3.org/1999/xhtml"><p> Multimemetic algorithms (MMAs) are a subclass of memetic algorithms in which memes are explicitly attached to genotypes and evolve alongside them. We analyze the propagation of memes in MMAs with a spatial structure. For this purpose we propose an idealized selecto-Lamarckian model that only features selection and local improvement, and study under which conditions good, high-potential memes can proliferate. We compare population models with panmictic and toroidal grid topologies. We show that the increased takeover time induced by the latter is essential for improving the chances for good memes to express themselves in the population by improving their hosts, hence enhancing their survival rates. Experiments realized with an actual MMA on three different complex pseudo-Boolean functions are consistent with these findings, indicating that memes are more successful in a spatially structured MMA, rather than in a panmictic MMA, and that the performance of the former is significantly better than that of its panmictic counterpart</p></abstract>

Multimemetic algorithms (MMAs) are a subclass of memetic algorithms in which memes are explicitly attached to genotypes and evolve alongside them. We analyze the propagation of memes in MMAs with a spatial structure. For this purpose we propose an idealized selecto-Lamarckian model that only features selection and local improvement, and study under which conditions good, high-potential memes can proliferate. We compare population models with panmictic and toroidal grid topologies. We show that the increased takeover time induced by the latter is essential for improving the chances for good memes to express themselves in the population by improving their hosts, hence enhancing their survival rates. Experiments realized with an actual MMA on three different complex pseudo-Boolean functions are consistent with these findings, indicating that memes are more successful in a spatially structured MMA, rather than in a panmictic MMA, and that the performance of the former is significantly better than that of its panmictic counterpart

A study on meme propagation in multimemetic algorithms

Department of Computer Science and Programming Languages Higher Technical School of Computer Engineering University of Málaga, Campus de Teatinos, 29071 Málaga, Spain

International Journal of Applied Mathematics and Computer Science

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

{"article-title":"A study on meme propagation in multimemetic algorithms"}

Multimemetic algorithms (MMAs) are a subclass of memetic algorithms in which memes are explicitly attached to genotypes and evolve alongside them. We analyze...

A study on meme propagation in multimemetic algorithms

Article Category: Special Section Title: Agents in Intelligent Computing and Simulation Systems, Editors: Aleksander Byrski, Marek Kisiel-Dorohinicki, Grzegorz Dobrowolski

Data publikacji: 30 wrz 2015

Zakres stron: 499 - 512

Otrzymano: 06 cze 2014

DOI: https://doi.org/10.1515/amcs-2015-0037

© by Carlos Cotta

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.