Abstract
The bee colony optimization BCO algorithm is a nature-inspired meta-heuristic method for dealing with hard, real-life combinatorial and continuous optimisation problems. It is based on the foraging habits of honeybees and was proposed by Lucic and Teodorovic in 2001. BCO is a simple, but effective meta-heuristic method that has already been successfully applied to various combinatorial optimisation problems in transport, location analysis, scheduling and some other fields. This paper provides theoretical verification of the BCO algorithm by proving some convergence properties. As a result, the gap between successful practice and missing theory is reduced.
Sign-in/Register to access full text options 
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.
