期刊
JOURNAL OF COMPUTATIONAL SCIENCE
卷 5, 期 2, 页码 224-232出版社
ELSEVIER
DOI: 10.1016/j.jocs.2013.10.002
关键词
Bat algorithm; Chaos; Metaheuristic; Global optimization
Bat algorithm (BA) is a recent metaheuristic optimization algorithm proposed by Yang. In the present study, we have introduced chaos into BA so as to increase its global search mobility for robust global optimization. Detailed studies have been carried out on benchmark problems with different chaotic maps. Here, four different variants of chaotic BA are introduced and thirteen different chaotic maps are utilized for validating each of these four variants. The results show that some variants of chaotic BAs can clearly outperform the standard BA for these benchmarks. (C) 2013 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据