arrow
返回

A parallel constrained lower confidence bounding approach for computationally expensive constrained optimization problems

delete2021-07-01
delete14
PRE
AI
C
Cheng Ji
P
Ping Jiang
周奇 封面图
周奇 (Qi Zhou) *
胡杰翔 封面图
胡杰翔 (Jiexiang Hu)
L
Leshi Shu
DOI:10.1016/j.asoc.2021.107276delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Computationally expensive constrained optimization problems (COPs) are very common in real-world engineering designs. This work proposes a parallel constrained lower confidence bounding (PCLCB) approach to solve challenging optimization problems with computationally expensive objective and constraints. In the PCLCB approach, a two-phase constrained lower confidence bounding (CLCB) criterion is proposed to adaptively allocate infill sample points. In the first phase where no feasible solution exists, a lower confidence bounding (LCB) function of constraints is developed to search for feasible points and improve the accuracies of the Kriging models. After a feasible point is found, the CLCB criterion focuses on local search in the second phase to improve the obtained optimum. In this phase, the search is implemented in a limited region where points may be feasible. Furthermore, an enhanced Kriging believer strategy is presented to parallelize the CLCB criterion to generate a batch of candidate points at each iteration. The PCLCB approach is tested on sixteen numerical benchmark cases and compared with the state-of-the-art alternative methods. Results indicate that the performance of PCLCB is highly competitive to the recently published algorithms in terms of efficiency and effectiveness. To verify the capability of PCLCB in solving real-world engineering problems, the lightweight design of micro-aerial vehicle (MAV) fuselage is presented. The weight of the MAV fuselage obtained by the proposed approach is on average 3.5% less than that of the other alternative methods. (C) 2021 Elsevier B.V. All rights reserved.
Keyword:
Constrained design optimization
Surrogate based design optimization
Constrained lower confidence bounding
Parallel computing
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Applied Soft Computing 封面图
Applied Soft Computing
IF:
6.6
论文数:
1.4W
被引数:
4.8W

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
err分享
err收藏
Self-adjusting parameter control for surrogate-assisted constrained optimization under limited budgets
err2017-12-01
err48
PREAI
errBagheri, Samineh; Konen, Wolfgang; Emmerich, Michael; Baeck, Thomas
err分享
err收藏
学者 查看更多内容