检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:戴嘉伟 罗伟林[1] DAI Jia-wei;LUO Wei-lin(School of Mechanical Engineering and Automation,Fuzhou University,Fuzhou 350108,China)
机构地区:[1]福州大学机械工程及自动化学院,福建福州350108
出 处:《机电工程》2020年第12期1409-1415,共7页Journal of Mechanical & Electrical Engineering
基 金:福建省海洋高新产业发展专项基金资助项目(闽海洋高新[2016]16号)。
摘 要:针对多学科设计优化中传统静态代理模型全局收敛性差和计算效率低的问题,基于径向基函数提出了一类动态代理模型优化策略。利用最优拉丁超立方试验设计方法确定初始样本点,建立了径向基函数模型,综合应用信赖域方法和置信下限准则构造了动态样本空间;根据代理模型精度动态更新信赖域采样空间,通过代理模型预测值与真实模型响应值之间的误差,确定了置信下限中的自适应平衡常数,并采用遗传算法对置信下限准则进行了优化;结合数学测试算例和NASA减速器优化设计,对该方法的有效性进行了验证。研究结果表明:该方法是有效的,不仅能得到全局最优解,还能显著提高计算效率。Aiming at the problem of poor global convergence and low computational efficiency of traditional static metamodel in multidisciplinary design optimization,an optimization strategy for dynamic metamodel was proposed by combining trust region and adaptive lower confidence bound.In this strategy,the initial sampling points were selected by optimal Latin hypercube test design method and the radial basis function metamodel was constructed.The trust region method and the lower confidence limit criterion were used to construct the dynamic sample space.According to the accuracy of the agent model,the trust region sampling space was updated.The adaptive equilibrium constant in the lower confidence bound was determined by the error between the predictive value of agent model and response value of real model.The lower confidence bound was optimized by using genetic algorithm.The optimization strategy was verified by using a numerical test problem and the NASA speed reducer optimization design.The results indicate that the proposed method is proved to be effective,and can not only guarantee the optimal solution,but also significantly improve the computational efficiency.
关 键 词:动态代理模型 径向基函数 信赖域 置信下限 减速器
分 类 号:TH122[机械工程—机械设计及理论] TH132.46
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222