.png){kind=icon}
返回
Constrained Optimization by Artificial Bee Colony Framework
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2018.2880814.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a novel artificial bee colony (ABC) algorithm for constrained optimization problems (COPs), named COABC, is proposed. The proposed approach treats a COP as a bi-objective optimization problem where the first one remains the same objective function itself while the second one is the degree of constraint violations. Then, the whole population is classed into dual subpopulations based on the partition method. The feasibility rule and the epsilon constrained method are employed to compare two solutions in two subpopulations, respectively, which can archive a suitable balance between infeasible solutions and feasible solutions. Next, a multistrategy technique which consists of three diverse search strategies is served as the search method on the two subpopulations. This technique plays a major part in balancing between the diversity and the convergence. Finally, the comparison results on a set of benchmark functions denote that COABC performs competitively and effectively when compared with the selected state-of-the-art algorithms.
Keyword:
Evolutionary algorithms
artificial bee colony algorithm
constrained optimization
partition method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容