期刊
出版社
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S0218001416590072
关键词
Evolutionary algorithm; multi-modal optimization problems; niching; decomposition
This paper presents a niching-based evolutionary algorithm for optimizing multi-modal optimization function. Provided that the potential optima are characterized by a relatively smaller objective value than their neighbors and by a relatively large distance from points with smaller objective values, we identify potential optima from individuals. Using them as seeds, a population is decomposed into a number of subpopulations without introducing new parameters. Moreover, we present an adaptive allocating strategy of assigning different computational resources to different subpopulations upon the fact that discovering different optima may have different computational difficulty. The proposed method is compared with three state-of-the-art multi-modal optimization approaches on a benchmark function set. The extensive experimental results demonstrate its efficacy.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据