首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于结构可置信性鲁棒优化算法的离散优化问题研究
引用本文:杜剑明,杜宗亮,刘畅,张维声,郭旭.基于结构可置信性鲁棒优化算法的离散优化问题研究[J].计算力学学报,2021,38(4):538-548.
作者姓名:杜剑明  杜宗亮  刘畅  张维声  郭旭
作者单位:大连大学机械工程学院,大连116622;大连理工大学工业装备国家重点实验室工程力学系,大连116024;大连理工大学宁波研究院,宁波315016;大连理工大学工业装备国家重点实验室工程力学系,大连116024;大连理工大学宁波研究院,宁波315016
基金项目:国家自然科学基金(11821202;11732004;12002073;12002077;11922204;11872141);科技部国家重点研发计划(2020YFB1709401;2016YFB0201601);大连大学博士启动基金(2021QL02);博士后科学基金(2020T130078;2020M680944)资助项目.
摘    要:传统优化设计认为问题的参数(如材料属性和外加载荷等)是确定的,并且设计变量通常是连续的.而在实际应用中产品制造和测量等存在不可避免的误差,并且工程需要的设计结果(如钢筋截面尺寸等)往往是离散的.即使对于考虑了不确定性参数影响的连续最优解,经过圆整处理后也很可能产生较大偏差甚至变得不可行.针对该难点,本文结合非概率不确定性鲁棒优化算法,建立与离散的基于圆整策略的优化算法列式等价的鲁棒优化列式及用于解决离散优化问题的可置信性鲁棒优化方法.并进一步研究了离散变量不确定性优化问题的可置信性鲁棒优化求解方法,利用非线性半定规划进行高效求解,可严格保证所得结果的可行性.本文揭示了传统离散优化思想和不确定性优化思想的内在联系,完善了优化设计理论体系,为后续相关研究提供了全新思路和示范.

关 键 词:优化设计  离散优化  可置信性鲁棒优化  非线性半定规划
收稿时间:2021/6/15 0:00:00
修稿时间:2021/7/8 0:00:00

A study on discrete optimization problem based on confidence structural robust optimization algorithm
DU Jian-ming,DU Zong-liang,LIU Chang,ZHANG Wei-sheng,GUO Xu.A study on discrete optimization problem based on confidence structural robust optimization algorithm[J].Chinese Journal of Computational Mechanics,2021,38(4):538-548.
Authors:DU Jian-ming  DU Zong-liang  LIU Chang  ZHANG Wei-sheng  GUO Xu
Institution:Department of Mechanical Engineering, Dalian University, Dalian 116622, China;State Key Laboratory of Structural Analysis for Industrial Equipment, Department of Engineering Mechanics, Dalian University of Technology, Dalian 116023, China;Ningbo Institute of Dalian University of Technology, Ningbo 315016, China
Abstract:It is always assumed the parameters in traditional optimization design problems (such as material properties, applied loads) are deterministic and continuous variables. Due to the unavoidable uncertainties in manufacturing or measurement, however, in practical applications, the desired results in engineering are often discrete. Even if the continuous optimal solution considers the influence of uncertain parameters, after rounding, it is likely to produce large deviations or even become no longer feasible. Combining the robust optimization algorithm considering non-probabilistic uncertain parameters, a confidence-robust optimization method equivalent to the discrete optimization sequence based on the rounding strategy is proposed for solving discrete optimization problems. The confidence-robust optimization solution method of discrete optimization problems with uncertain parameters is further studied using nonlinear semi-definite programming efficiently, which can strictly guarantee the feasibility of the obtained results. It is expected to reveal the underlying connection between traditional discrete optimization ideas and uncertain optimization ideas, improve the theoretical system of optimization design, and provide new ideas and demonstrations for subsequent related research.
Keywords:optimal design  discrete optimization  confidence robust optimization  non-liner semidefinite program
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算力学学报》浏览原始摘要信息
点击此处可从《计算力学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号