.png){kind=icon}
返回
Distributed and Expensive Evolutionary Constrained Optimization With On-Demand Evaluation
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2022.3177936.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Expensive optimization problems (EOPs) are common in industry and surrogate-assisted evolutionary algorithms (SAEAs) have been developed for solving them. However, many EOPs have not only expensive objective but also expensive constraints, which are evaluated through distributed ways. We define this kind of EOPs as distributed expensive constrained optimization problems (DECOPs). The distributed characteristic of DECOPs leads to the asynchronous evaluation of both objective and constraints. Though some researchers have studied the asynchronous evaluation of objectives, the asynchronous evaluation of constraints has not gained much attention. Therefore, this article gives a formal formulation of DECOPs and proposes a distributed evolutionary constrained optimization algorithm with on-demand evaluation (DEAOE). DEAOE can adaptively evolve different constraints in an asynchronous way through the on-demand evaluation strategy. The on-demand evaluation works from two aspects to improve the population convergence and diversity. From the aspect of individual selection, a joint sample selection strategy is adopted to determine which candidates are promising. From the aspect of constraint selection, an infeasible-first evaluation strategy is devised to judge which constraints need to be further evolved. Extensive experiments and analyses on benchmark functions and engineering problems demonstrate that DEAOE has better performance and higher efficiency compared to centralized state-of-the-art SAEAs.
Keyword:
Differential evolution (DE)
distributed optimization
on-demand evaluation
surrogate-assisted evolutionary algorithm (SAEA)
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
.png){kind=icon}
A Kriging-Assisted Two-Archive Evolutionary Algorithm for Expensive Many-Objective Optimization
PREAI
分享收藏
查看更多内容