arrow
返回

A Probabilistic Memetic Framework

delete2009-06-01
delete194
delete
OA
AI
Q
Quang Huy Nguyen *
Y
Yew-Soon Ong
M
Meng Hiot Lim
DOI:10.1109/TEVC.2008.2009460delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Memetic algorithms (MAs) represent one of the recent growing areas in evolutionary algorithm (EA) research. The term MAs is now widely used as a synergy of evolutionary or any population-based approach with separate individual learning or local improvement procedures for problem search. Quite often, MAs are also referred to in the literature as Baldwinian EAs, Lamarckian EAs, cultural algorithms, or genetic local searches. In the last decade, MAs have been demonstrated to converge to high-quality solutions more efficiently than their conventional counterparts on a wide range of real-world problems. Despite the success and surge in interests on MAs, many of the successful MAs reported have been crafted to suit problems in very specific domains. Given the restricted theoretical knowledge available in the field of MAs and the limited progress made on formal MA frameworks, we present a novel probabilistic memetic framework that models MAs as a process involving the decision of embracing the separate actions of evolution or individual learning and analyzing the probability of each process in locating the global optimum. Further, the framework balances evolution and individual learning by governing the learning intensity of each individual according to the theoretical upper bound derived while the search progresses. Theoretical and empirical studies on representative benchmark problems commonly used in the literature are presented to demonstrate the characteristics and efficacies of the probabilistic memetic framework. Further, comparisons to recent state-of-the-art evolutionary algorithms, memetic algorithms, and hybrid evolutionary-local search demonstrate that the proposed framework yields robust and improved search performance.
Keyword:
Hybrid genetic algorithm-local search (GA-LS)
memetic algorithm (MA)
probabilistic evolutionary algorithms

期刊

IEEE Transactions on Evolutionary Computation 封面图
IEEE Transactions on Evolutionary Computation
IF:
12
论文数:
1.9K
被引数:
2.4W

机构

N
Nanyang Technological University
学者数:
4.9W
论文数: 4.8W
被引数: 8.1W
引用论文

引用论文

The overlooked benefits of synzoochory: rodents rescue seeds from aborted fruits
err2020-11-18
err0
errOAAI
errJose M. Fedriani; Gemma Calvo; Miguel Delibes; Daniel Ayllón; Pedro J. Garrote
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
An evaluation of hydrometric monitoring across the Canadian pan-Arctic region, 1950–2008
err2011-12-01
err0
errOAAI
errTheo J. Mlynowski; Marco A. Hernández-Henríquez; Stephen J. Déry
err分享
err收藏
err分享
err收藏
Effect of the electrical double layer on voltammetry at microelectrodes
err2002-05-01
err0
PREAI
errJohn D. Norton; Henry S. White; Stephen W. Feldberg
err分享
err收藏
学者 查看更多内容