.png){kind=icon}
.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Evolutionary algorithms
artificial bee colony algorithm
constrained optimization
partition method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.