期刊
NEURAL COMPUTING & APPLICATIONS
卷 24, 期 3-4, 页码 723-734出版社
SPRINGER LONDON LTD
DOI: 10.1007/s00521-012-1285-7
关键词
Artificial bee colony; Multiobjective optimization; Feasible rule; Improved algorithm; Exploration; Exploitation
资金
- National Natural Science Foundation of China [60803102, 60473042, 60573067]
The artificial bee colony is a simple and effective global optimization algorithm. It has been successfully applied to solve a wide range of real-world optimization problem, and later, it was extended to constrained design problems as well. This paper describes a self-adaptive constrained artificial bee colony algorithm for constrained optimization problem based on feasible rule method and multiobjective optimization method. The employed bee colony severs as the global search engine for each population based on feasible rule. Then, the onlooker bee colony can explore the new search space based on the multiobjective optimization. In order to enhance the convergence rate of the proposed algorithm, a self-adaptive modification rate is proposed to make the algorithm can change many parameters. To verify the performance of our approach, 24 well-known constrained problems from 2006 IEEE congress on Evolution Computation (CEC2006) are employed. Experimental results indicate that the proposed algorithm performs better than, or at least comparable to, state-of-the-art approaches in terms of the quality of the resulting solutions from literature.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据