Authors: Teodorović, Dušan
Šelmić, Milica
Davidović, Tatjana 
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Bee colony optimization Part II: The application survey
Journal: Yugoslav Journal of Operations Research
Volume: 25
Issue: 2
First page: 185
Last page: 219
Issue Date: 1-Jan-2015
Rank: M51
ISSN: 0354-0243
DOI: 10.2298/YJOR131029020T
Bee Colony Optimization (BCO) is a meta-heuristic method based on foraging habits of honeybees. This technique was motivated by the analogy found between the natural behavior of bees searching for food and the behavior of optimization algorithms searching for an optimum in combinatorial optimization problems. BCO has been successfully applied to various hard combinatorial optimization problems, mostly in transportation, location and scheduling fields. There are some applications in the continuous optimization field that have appeared recently. The main purpose of this paper is to introduce the scientific community more closely with BCO by summarizing its existing successful applications.
Keywords: Combinatorial optimization | Location | Meta-heuristic methods | Routing | Scheduling problems | 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.