Abstract
The Bee Colony Optimization (BCO) meta-heuristic deals with combinatorial optimization problems. It is biologically inspired method that explores collective intelligence applied by the honey bees during nectar collecting process. In this paper we perform empirical study of the BCO algorithm. We apply BCO to optimize numerous numerical test functions. The obtained results are compared with the results in the literature. The numerical experiments performed on well-known benchmark functions show that the BCO is competitive with other methods and it can generate high-quality solutions within negligible CPU times.
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.
