检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京航空航天大学工程系统工程系,北京100191
出 处:《系统工程与电子技术》2009年第5期1108-1112,共5页Systems Engineering and Electronics
基 金:国家重点基础研究发展计划"973"项目(61382);装备预先研究项目(513190201-1)资助课题
摘 要:针对一致性约束条件造成协同优化方法计算困难的问题,研究提出了一种自适应协同优化方法。首先将设计变量空间划分为三类区域,分析了每个区域内一致性约束松弛量与系统可行域和学科一致性的关系,并在此基础上提出了三种一致性约束松弛量的确定方法。然后基于上述方法,给出了自适应协同优化的算法流程,对比分析了相对于标准协同优化算法流程的改进之处。最后采用自适应协同优化方法对两个典型MDO算例进行优化,证明了该方法具有较好的鲁棒性和收敛速度。Aiming at the computational difficulties of collaborative optimization caused by consistency constraints, an adaptive collaborative optimization method is presented. Firstly, design variables space is split into three kinds of regions, then the relations among the relaxed tolerances of consistency constraints, system feasibility and subsystem consistency are analyzed within each region. Based on that analysis, three methods of relaxed tolerances to calculate are given. Secondly, the algorithm flow of the adaptive collaborative optimization method is proposed, and the improvement is analyzed comparing with the standard collaborative optimization method. Finally, two classic MDO test suites are optimized by the proposed adaptive collaborative optimization method, and the result shows its advantage on robustness and convergence rate.
分 类 号:O224[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.195