Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1181.90167
Özbakir, Lale; Baykasoğlu, Adil; Tapkan, P inar
Bees algorithm for generalized assignment problem. (English)
[J] Appl. Math. Comput. 215, No. 11, 3782-3795 (2010). ISSN 0096-3003

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.

MSC 2000:: *90B80 Discrete location and assignment
90C59 Approximation methods and heuristics
90C10 Integer programming

Keywords: meta-heuristics; bees algorithm; generalized assignment problem; ejection chain; integer programming; swarm intelligence

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]