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. [Projekat Ministarstva nauke Republike Srbije, br. OI174010, OI174033, TR36002]
Document type: Article
Abstract
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 [...]
Bee Colony Optimization - part II: The application survey 