When and what kind of memetic algorithms perform well

Jih Yiing Lin*, Ying-Ping Chen

*Corresponding author for this work

研究成果: Conference contribution同行評審

3 引文 斯高帕斯(Scopus)

摘要

The synergy between exploration and exploitation has been a prominent issue in optimization. The rise of memetic algorithms, a category of optimization techniques which feature the explicit exploration-exploitation coordination, much accentuates this issue. While memetic algorithms have achieved remarkable success in a wide range of real-world applications, the key to a successful exploration-exploitation synergy still remains obscure. Manifold empirical results and theoretical derivations have been proposed and provided various perspectives from different algorithm-problem complexes to this issue. In our previous work, the concept of local search zones was proposed to provide an alternative perspective depicting the general behavior of memetic algorithms on a broad range of problems. In this work, based on the local search zone concept, we further investigate how the problem landscape and the way the algorithm explores and exploits the search space affect the performance of a memetic algorithm. The collaborative behavior of several representative archetypes of memetic algorithms, which exhibit different degrees of explorability and exploitability, are illustrated empirically and analytically on problems with different landscapes. As the empirical results consist with the local search zone concept and describe the behavior of various memetic algorithms on different problems, this work may reveal some essential design principals for memetic algorithms.

原文English
主出版物標題2012 IEEE Congress on Evolutionary Computation, CEC 2012
DOIs
出版狀態Published - 4 十月 2012
事件2012 IEEE Congress on Evolutionary Computation, CEC 2012 - Brisbane, QLD, Australia
持續時間: 10 六月 201215 六月 2012

出版系列

名字2012 IEEE Congress on Evolutionary Computation, CEC 2012

Conference

Conference2012 IEEE Congress on Evolutionary Computation, CEC 2012
國家Australia
城市Brisbane, QLD
期間10/06/1215/06/12

指紋 深入研究「When and what kind of memetic algorithms perform well」主題。共同形成了獨特的指紋。

引用此