Scheduling independent tasks: Bee Colony Optimization approach

Authors:
Tatjana Davidovic;Milica Selmic;Dusan Teodorovic
Affiliations:
Mathematical Institute of SASA, Belgrade, Serbia;Faculty of Transport and Traffic Engineering, Belgrade, Serbia;Faculty of Transport and Traffic Engineering, Belgrade, Serbia
Venue:
MED '09 Proceedings of the 2009 17th Mediterranean Conference on Control and Automation
Year:
2009

Citing 0
Cited 3

Bee colony optimization for the p-center problem

Computers and Operations Research
Empirical study of the Bee Colony Optimization (BCO) algorithm

Expert Systems with Applications: An International Journal
Transit network design by Bee Colony Optimization

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of static scheduling of independent tasks on homogeneous multiprocessor systems is studied in this paper. The problem is solved by the Bee Colony Optimization (BCO). The BCO algorithm belongs to the class of stochastic swarm optimization methods. The proposed algorithm is inspired by the foraging habits of bees in the nature. The BCO algorithm was able to obtain the optimal value of objective function in all small to medium size test problems. The CPU times required to find the best solutions by the BCO are acceptable.