Artificial bee colony with bidirectional search

DOI10.1504/IJCSM.2016.081696MaRDI QIDQ2224147zbMATH OpenFDO

Authors Yanyan Li

Publication date 3 February 2021

Published in International Journal of Computing Science and Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/IJCSM.2016.081696

zbMATH Keywords

ABCartificial bee colonybidirectional searchglobal best individualmetaheuristicsoptimisationsearch strategyswarm intelligence

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: Artificial bee colony (ABC) is an efficient meta-heuristic, which has shown good search abilities on many optimisation problems. In the standard ABC, its solution updating equation uses a random weight to control the difference vector between the current food source and another randomly selected one, and the random weight between \(-1\) and 1 determines the search directions. How to select a good search direction is not an easy task. In this paper, we propose a new ABC algorithm called ABC with bidirectional search, which employs a new method to control the search direction of ABC. To verify the effectiveness of the bidirectional search method, we embed it into two ABC variants and test compares their performance with their corresponding parent algorithms. Experimental results on six benchmark functions show that the bidirectional search method can effectively improve the performance of ABC.

Recommendations

• Improved multi-strategy artificial bee colony algorithm
• A modified artificial bee colony algorithm
• A comparative study of artificial bee colony algorithm
• An adaptive artificial bee colony algorithm for global optimization
• Self-adaptive artificial bee colony for function optimization

This page was built for publication: Artificial bee colony with bidirectional search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224147)