Abstract
To solve the problem that Artificial Bee Colony (ABC) algorithm is easy to fall into local optimum, this paper proposes an improved Artificial Bee Colony (ABC) algorithm with advanced search ability. This algorithm focuses on adding the number of scouts by comparing the maximum value $Bas_{\max}$ , the second largest value $Bas_{second}$ and the third largest value $Bas_{third}$ of $Bas(i)$ with the parameter limit. Inspired by the method of introducing modification rate (MR), the solution generation method of $Bas_{\sec ond}$ is modified to increase disturbance. Six benchmark functions are used to test the efficiency and stability of the algorithm, and the simulation results show the improved ABC algorithm with advanced search ability performs better than ABC algorithm in high dimensional space.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
