A study on the use of ``self-generation in memetic algorithms

DOI10.1023/B:NACO.0000023419.83147.67zbMath1074.68064MaRDI QIDQ1768782

Steven Gustafson, Natalio Krasnogor

Publication date: 15 March 2005

Published in: Natural Computing (Search for Journal in Brave)

zbMATH Keywords

memetic algorithmsself-generationcontact map overlapNK-Landscapesself-assembling

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (13)

Memetic algorithms for parallel code optimization ⋮ DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic ⋮ Memetic algorithms-based neural network learning for basic oxygen furnace endpoint prediction ⋮ A study on diversity and cooperation in a multiagent strategy for dynamic optimization problems ⋮ Adaptive multimeme algorithm for flexible job shop scheduling problem ⋮ Hybridizing evolutionary algorithms with variable-depth search to overcome local optima ⋮ A co-evolving framework for robust particle swarm optimization ⋮ Monte Carlo hyper-heuristics for examination timetabling ⋮ A study on meme propagation in multimemetic algorithms ⋮ Studying self-balancing strategies in island-based multimemetic algorithms ⋮ Self-healing strategies for memetic algorithms in unstable and ephemeral computational environments ⋮ The impact of parametrization in memetic evolutionary algorithms ⋮ Centroid-based memetic algorithm – adaptive Lamarckian and Baldwinian learning

This page was built for publication: A study on the use of ``self-generation in memetic algorithms