Abstract

Artificial Bee Colony (ABC) is a swarm based stochastic search algorithm inspired by the foraging behavior of honeybees. Due to the simplicity of implementation and promising optimization capability, ABC is successfully applied to solve wide class of scientific and engineering optimization problems. But, it has problems of premature convergence and trapping in local optima. In this paper, to enhance the performance of ABC, we have proposed a modified version of ABC algorithm using Differential Evolution (DE) and Polynomial Mutation (PM) called DE-PM-ABC. The comparison with ABC by Karaboga [1], MABC [27] by Liu et al. using some benchmark functions of CEC 2005 demonstrates that our approach achieves a good trade-off between exploration and exploitation and thus obtains better global optimization result and faster convergence speed.

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.