Artificial bee colony algorithm for large-scale problems and engineering design optimization

被引:405
作者
Akay, Bahriye [1 ]
Karaboga, Dervis [1 ]
机构
[1] Erciyes Univ, Dept Comp Engn, TR-38039 Kayseri, Turkey
关键词
Unconstrained optimization; Constrained optimization; Mechanical design problems; Artificial bee colony; PARTICLE SWARM OPTIMIZATION; CONSTRAINED OPTIMIZATION; EVOLUTIONARY ALGORITHMS;
D O I
10.1007/s10845-010-0393-4
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Engineering design problems are generally large scale or nonlinear or constrained optimization problems. The Artificial Bee Colony (ABC) algorithm is a successful tool for optimizing unconstrained problems. In this work, the ABC algorithm is used to solve large scale optimization problems, and it is applied to engineering design problems by extending the basic ABC algorithm simply by adding a constraint handling technique into the selection step of the ABC algorithm in order to prefer the feasible regions of entire search space. Nine well-known large scale unconstrained test problems and five well-known constrained engineering problems are solved by using the ABC algorithm and the performance of ABC algorithm is compared against those of state-of-the-art algorithms.
引用
收藏
页码:1001 / 1014
页数:14
相关论文
共 43 条
[1]  
[Anonymous], P 4 ANN C EV PROGR
[2]  
[Anonymous], 2006, IEEE SWARM INT S 200
[3]   Constraint satisfaction techniques in planning and scheduling [J].
Bartak, Roman ;
Salido, Miguel A. ;
Rossi, Francesca .
JOURNAL OF INTELLIGENT MANUFACTURING, 2010, 21 (01) :5-15
[4]  
Bean J. C., 1992, R A I R O R IN PRESS
[5]  
Boyer FDO., 2005, J ARTIF INTELL RES, V24, P1, DOI [10.1613/jair.1660, DOI 10.1613/JAIR.1660]
[6]   Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art [J].
Coello, CAC .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2002, 191 (11-12) :1245-1287
[7]  
Coello Coello C. A, 1999, MBASASOFT GEDIT WIND
[8]  
Corne D., 1999, New ideas in optimization
[9]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338
[10]   An experimental study of benchmarking functions for genetic algorithms [J].
Digalakis, JG ;
Margaritis, KG .
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2002, 79 (04) :403-416