个人信息Personal Information
教授
博士生导师
硕士生导师
性别:男
毕业院校:西北工业大学
学位:博士
所在单位:机械工程学院
学科:测试计量技术及仪器. 精密仪器及机械. 机械制造及其自动化. 机械电子工程
电子邮箱:duanfh@dlut.edu.cn
A robust global optimization approach to solving CO problems - enhanced design space decrease collaborative optimization
点击次数:
论文类型:期刊论文
发表时间:2017-06-01
发表刊物:STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION
收录刊物:SCIE、EI
卷号:55
期号:6
页面范围:2305-2322
ISSN号:1615-147X
关键字:Multidisciplinary design optimization (MDO); Collaborative optimization (CO); Global optimization; Infeasible Region; Linear inequality constraint
摘要:Collaborative optimization (CO) is a decomposition-based multidisciplinary design optimization method that sometimes suffers from two predominant drawbacks: computational inefficiency and nonexistence of Lagrange multipliers when the system-level optimization solution is system-level feasible. To overcome aforementioned drawbacks, we propose enhanced design space decrease collaborative optimization (EDSDCO). It can notably simplify the system-level optimization problem through modifying the system-level consistency equality constraints that exist in the standard CO to create some linear inequality constraints with no tolerance. Thus, the aforementioned drawbacks, mainly resulted by the use of equality forms of consistency constraints, can be successfully overcome. During the process of optimization, the updated system-level solution space is constantly decreased; meanwhile, the original feasible region is entirely preserved throughout regardless of whether the constraints are convex. Consequently, the global optimum can be obtained when the system-level optimization solution moves into the original feasible region. In EDSDCO, the starting point is not introduced to the formulas of subsystem or system-level optimization. Therefore, the optimum obtained using EDSDCO cannot be affected by the parameters of the starting points, which certainly enhances EDSDCO's robustness. EDSDCO converges faster than design space decrease collaborative optimization for two reasons: deleting more original infeasible region fragments per iteration and more efficient decision to choose the next solution subspace. In order to illustrate the proposed method's capabilities, we describe the principles and process of EDSDCO and discuss its application to three optimization problems: a numerical test problem, gear reducer design problem, and combustion of propane problem.