Bees algorithm for generalized assignment problem

Bees algorithm (BA) is a new member of meta-heuristics. BA tries to model natural behavior of honey bees in food foraging. Honey bees use several mechanisms like waggle dance to optimally locate food sources and to search new ones. This makes them a good candidate for developing new algorithms for s...

Full description

Saved in:
Bibliographic Details
Published in:Applied mathematics and computation Vol. 215; no. 11; pp. 3782 - 3795
Main Authors: Özbakir, Lale, Baykasoğlu, Adil, Tapkan, Pınar
Format: Journal Article
Language:English
Published: Amsterdam Elsevier Inc 01.02.2010
Elsevier
Subjects:
Bees algorithm
Calculus of variations and optimal control
Ejection chain
Exact sciences and technology
Generalized assignment problem
Integer programming
Mathematical analysis
Mathematics
Meta-heuristics
Numerical analysis
Numerical analysis. Scientific computation
Numerical methods in mathematical programming, optimization and calculus of variations
Numerical methods in optimization and calculus of variations
Sciences and techniques of general use
Swarm intelligence
Bees algorithm
Integer programming
Generalized assignment problem
Swarm intelligence
Meta-heuristics
Ejection chain
Optimization method
Algorithm
Integer
Gap problem
Numerical analysis
Applied mathematics
NP hard problem
Problem solving
Variational calculus
Mathematical programming
ISSN:0096-3003, 1873-5649
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Bees algorithm (BA) is a new member of meta-heuristics. BA tries to model natural behavior of honey bees in food foraging. Honey bees use several mechanisms like waggle dance to optimally locate food sources and to search new ones. This makes them a good candidate for developing new algorithms for solving optimization problems. In this paper a brief review of BA is first given, afterwards development of a BA for solving generalized assignment problems (GAP) with an ejection chain neighborhood mechanism is presented. GAP is a NP-hard problem. Many meta-heuristic algorithms were proposed for its solution. So far BA is generally applied to continuous optimization. In order to investigate the performance of BA on a complex integer optimization problem, an attempt is made in this paper. An extensive computational study is carried out and the results are compared with several algorithms from the literature.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2009.11.018