Memetic algorithms and memetic computing optimization: A literature review

F Neri, C Cotta - Swarm and Evolutionary Computation, 2012 - Elsevier
Memetic computing is a subject in computer science which considers complex structures
such as the combination of simple agents and memes, whose evolutionary interactions lead …

[HTML][HTML] Hyper-heuristics: A survey and taxonomy

T Dokeroglu, T Kucukyilmaz, EG Talbi - Computers & Industrial Engineering, 2023 - Elsevier
Hyper-heuristics are search techniques for selecting, generating, and sequencing (meta)-
heuristics to solve challenging optimization problems. They differ from traditional (meta) …

[图书][B] Introduction to evolutionary computing

AE Eiben, JE Smith - 2015 - Springer
This is the second edition of our 2003 book. It is primarily a book for lecturers and graduate
and undergraduate students. To this group the book offers a thorough introduction to …

[图书][B] Handbook of memetic algorithms

F Neri, C Cotta, P Moscato - 2011 - books.google.com
Memetic Algorithms (MAs) are computational intelligence structures combining multiple and
various operators in order to address optimization problems. The combination and …

[图书][B] Hyper-heuristics: theory and applications

N Pillay, R Qu - 2018 - Springer
Hyper-heuristics is a fairly recent technique that aims at effectively solving various real-world
optimization problems. This is the first book on hyper-heuristics, and aims to bring together …

A self-learning particle swarm optimizer for global optimization problems

C Li, S Yang, TT Nguyen - IEEE Transactions on Systems, Man …, 2011 - ieeexplore.ieee.org
Particle swarm optimization (PSO) has been shown as an effective tool for solving global
optimization problems. So far, most PSO algorithms use a single learning pattern for all …

A graph-based hyper-heuristic for educational timetabling problems

EK Burke, B McCollum, A Meisels, S Petrovic… - European Journal of …, 2007 - Elsevier
This paper presents an investigation of a simple generic hyper-heuristic approach upon a
set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Within …

A tabu-search hyperheuristic for timetabling and rostering

EK Burke, G Kendall, E Soubeiga - Journal of heuristics, 2003 - Springer
Hyperheuristics can be defined to be heuristics which choose between heuristics in order to
solve a given optimisation problem. The main motivation behind the development of such …

Classification of adaptive memetic algorithms: a comparative study

YS Ong, MH Lim, N Zhu… - IEEE Transactions on …, 2006 - ieeexplore.ieee.org
Adaptation of parameters and operators represents one of the recent most important and
promising areas of research in evolutionary computations; it is a form of designing self …

Hyper-heuristics

P Ross - … : introductory tutorials in optimization and decision …, 2005 - Springer
The term “hyper-heuristics” is fairly new, although the notion has been hinted at in papers
from time to time since the 1960s (eg Crowston et al., 1963). The key idea is to devise new …