Abstract

This paper presents a novel version of the bees algorithm. This version is characterized by an extended set of search operators, and a mechanism that protects the most recently generated solutions from competition with more evolved individuals. Compared to the standard implementation of the bees algorithm, the new procedure requires the selection of an additional set of parameters. A new statistical method is proposed to tune these extra parameters. The proposed tuning method was used to determine a unique set of learning parameters for the modified bees algorithm on eight popular function optimization benchmarks. When tested against the standard bees algorithm and two other well-known optimization procedures, the new algorithm attained top performances on nearly all the benchmarks. The experimental results also proved that, tested on a search space much larger than that where it was tuned, the modified bees algorithm still outperformed the standard method, and the degradation of the performance of the two algorithms was comparable. These results prove the effectiveness of the modified bees algorithm, and show that the proposed tuning procedure is a valuable alternative to the complex and subjective trial-and-error methods that are often used.

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.