Authors: Davidović, Tatjana 
Teodorović, Dušan
Šelmić, Milica
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Bee Colony Optimization part I: The algorithm overview
Journal: Yugoslav Journal of Operations Research
Volume: 25
Issue: 1
First page: 33
Last page: 56
Issue Date: 1-Jan-2015
Rank: M51
ISSN: 0354-0243
DOI: 10.2298/YJOR131011017D
This paper is an extensive survey of the Bee Colony Optimization (BCO) algorithm, proposed for the first time in 2001. BCO and its numerous variants belong to a class of nature-inspired meta-heuristic methods, based on the foraging habits of honeybees. Our main goal is to promote it among the wide operations research community. BCO is a simple, but effcient meta-heuristic technique that has been successfully applied to many optimization problems, mostly in transport, location and scheduling fields. Firstly, we shall give a brief overview of the meta-heuristics inspired by bees' foraging principles, pointing out the differences between them. Then, we shall provide the detailed description of the BCO algorithm and its modifications, including the strategies for BCO parallelization, and give the preliminary results regarding its convergence. The application survey is elaborated in Part II of our paper.
Keywords: Foraging of honey bees | Meta-heuristics | Swarm intelligence
Publisher: Faculty of Organizational Sciences, Belgrade
Project: Mathematical Modelas and Optimization Methods on Large-Scale Systems 
Graph theory and mathematical programming with applications in chemistry and computer science 
Computational Intelligence Techniques in Transportation and Communication Planning and Traffic Control 

Show full item record


checked on May 20, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.