4.7 Article

A tree-structured random walking swarm optimizer for multimodal optimization

期刊

APPLIED SOFT COMPUTING
卷 78, 期 -, 页码 94-108

出版社

ELSEVIER
DOI: 10.1016/j.asoc.2019.02.015

关键词

Artificial bee colony (ABC); Evolutionary algorithm (EA); Minimum spanning tree (MST); Multimodal optimization; Niching method

资金

  1. National Natural Science Foundation of China [61873095, 61873097, U1701267]
  2. Science and Technology Planning Project of Guangdong Province, China [2018B030312003]

向作者/读者索取更多资源

This paper develops a novel tree structured random walking swarm optimizer for seeking multiple optima in multimodal landscapes. First, we show that the artificial bee colony algorithm has some distinct advantages over the other swarm intelligence algorithms for accomplishing the multimodal optimization task, from analytical and experimental perspectives. Then, a tree-structured niching strategy is developed to assist the algorithm in exploring multiple optima simultaneously. The strategy constructs a weighted complete graph based on the positions of the food sources (candidate solutions). A minimum spanning tree that encodes the distribution of the food sources is built upon the complete graph to guide the search of the bee swarm. Each artificial bee sets out from a food source and flies along the edges of the tree to gather information about the search space. The dance trajectories of bees are simulated by a random walk model considering both distance and fitness information. Then, mutant vectors are selected from the trajectories to update the food source. This graph-based search method is introduced to simultaneously promote the progress of exploitation and exploration in multimodal environments. Extensive experiments indicate that our proposed algorithm outperforms several state-of-the-art algorithms. (C) 2019 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据