Classification of adaptive memetic algorithms: a comparative study.
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-configuring algorithms that acclimatize to suit the problem in hand. Here, our interests are on a recent breed of hybrid evolutionary algorithms typically known as adaptive memetic algorithms (MAs). One unique feature of adaptive MAs is the choice of local search methods or memes and recent studies have shown that this choice significantly affects the performances of problem searches. In this paper, we present a classification of memes adaptation in adaptive MAs on the basis of the mechanism used and the level of historical knowledge on the memes employed. Then the asymptotic convergence properties of the adaptive MAs considered are analyzed according to the classification. Subsequently, empirical studies on representatives of adaptive MAs for different type-level meme adaptations using continuous benchmark problems indicate that global-level adaptive MAs exhibit better search performances. Finally we conclude with some promising research directions in the area.
Ong
Yew-Soon
YS
School of Computer Engineering, Nanyang Technological University, Singapore 639798. asysong@ntu.edu.sg
Lim
Meng-Hiot
MH
Zhu
Ning
N
Wong
Kok-Wai
KW
D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D005246:Feedback; D016247:Information Storage and Retrieval / Q000379:methods*; D008962:Models, Theoretical; D013598:Systems Theory