A multi-strategy artificial bee colony algorithm with neighborhood search

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As an effective swarm intelligence based optimization technique, artificial bee colony (ABC) algorithm has become popular in recent years. However, its performance is still not satisfied in solving some complex optimization problems. The main reason is that both of the employed bee phase and onlooker bee phase use the same solution search equation to generate new candidate solutions, and the solution search equation is good at exploration but poor at exploitation. To solve this problem, in this paper, we propose a multi-strategy artificial bee colony algorithm with neighborhood search (MSABC-NS). In MSABC-NS, a multi-strategy mechanism is designed to use two different solution search equations, and a neighborhood search mechanism is introduced to make full use of good solutions. Experiments are conducted on 22 widely used benchmark functions, and three different ABC variants are included in the comparison. The results show that our approach can achieve better performance on most of the benchmark functions.

Cite

CITATION STYLE

APA

Sun, C., Zhou, X., & Wang, M. (2019). A multi-strategy artificial bee colony algorithm with neighborhood search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11655 LNCS, pp. 310–319). Springer Verlag. https://doi.org/10.1007/978-3-030-26369-0_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free