Bees algorithm for generalized assignment problem

被引:142
作者
Ozbakir, Lale [2 ]
Baykasoglu, Adil [1 ]
Tapkan, Pinar [2 ]
机构
[1] Gaziantep Univ, Dept Ind Engn, Gaziantep, Turkey
[2] Erciyes Univ, Dept Ind Engn, Kayseri, Turkey
关键词
Meta-heuristics; Bees algorithm; Generalized assignment problem; Ejection chain; Integer programming; Swarm intelligence; TABU SEARCH;
D O I
10.1016/j.amc.2009.11.018
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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. (C) 2009 Elsevier Inc. All rights reserved.
引用
收藏
页码:3782 / 3795
页数:14
相关论文
共 54 条
[1]  
Alfandari L, 2004, APPL OPTIM, V86, P1
[2]  
Alfandari L., 2001, Proceedings of the Fourth Metaheuristics International Conference, P175
[3]  
ALFANDARI L, 2002, 378 CNAM
[4]  
[Anonymous], P 5 CIRP INT SEM INT
[5]  
[Anonymous], 1990, Knapsack Problems: Algorithms and ComputerImplementations
[6]  
[Anonymous], 2007, 40 CIRP INT MAN SYST
[7]  
[Anonymous], P 2 INT WORKSH MATH
[8]  
BASTURK D, 2006, IEEE SWARM INT S IND
[9]  
BAYKASOGLU A, 2007, SWARM INTELLIGENCE F, P113
[10]  
BIANCO GM, 2004, P INT C INT ROB SYST, P619