Abstract

Artificial bee colony (ABC) is a novel swarm intelligence optimization algorithm that has been shown to be effective in solving high dimensional global optimization problem with good performance for its excellent exploration capability. It has received a great deal of attentions of researchers since it was proposed, and was employed to many application fields for its advantages of excellent global optimization ability and easy to implement. However, the basic ABC has some drawbacks like poor exploitation and slow convergence. In this paper, an improved artificial bee colony algorithm based on modified-neighborhood-based update operator and independent-inheriting-search strategy for global optimization called MNIIABC algorithm is proposed. In the proposed algorithm, a modified-neighborhood-based update operator, which contains a global-best term and a subset-best guided term, is applied in the employed bee stage to balance the exploration and exploitation. Aiming to improve the solution diversity, a subset partition method for producing perturbation term is considered. In order to enhance the exploitation of the algorithm, an independent-inheriting-search strategy is used in the onlooker stage. Experiment results tested on multiple benchmark functions show that the proposed method is effective, and has good performance. The comparison experimental results illustrate that the proposed algorithm has good solution quality and convergence characteristics.

Full Text
Paper version not known

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 call

Disclaimer: 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.