首页 | 官方网站   微博 | 高级检索  
     

一种求解鲁棒优化问题的多目标进化方法
引用本文:李亚林,陈静,罗彪,任亚峰,李密青.一种求解鲁棒优化问题的多目标进化方法[J].计算机工程与应用,2011,47(24):58-61.
作者姓名:李亚林  陈静  罗彪  任亚峰  李密青
作者单位:湘潭大学信息工程学院,湖南湘潭,411105
基金项目:国家自然科学基金,湖南省自然科学基金,湖南省教育厅重点科研项目,湖南省教育厅一般项目
摘    要:鲁棒优化问题(Robust Optimization Problem,ROP)是进化算法(Evolutionary Algorithms,EAs)研究的重要方面之一,对于许多实际工程优化问题,通常需要得到鲁棒最优解。利用多目标优化中的Pareto思想优化ROP的鲁棒性和最优性,将ROP转化为一个两目标的优化问题,一个目标为解的鲁棒性,一个目标为解的最优性。针对ROP与多目标优化的特点,利用动态加权思想,设计一种求解ROP的多目标进化算法。通过测试函数的实验仿真,验证了该方法的有效性。

关 键 词:鲁棒优化问题  多目标进化算法  干扰  鲁棒性  最优性
修稿时间: 

Evolutionary multi-objective approach for solving robust optimization problem
LI Yalin,CHEN Jing,LUO Biao,REN Yafeng,LI Miqing.Evolutionary multi-objective approach for solving robust optimization problem[J].Computer Engineering and Applications,2011,47(24):58-61.
Authors:LI Yalin  CHEN Jing  LUO Biao  REN Yafeng  LI Miqing
Affiliation:Institute of Information Engineering,Xiangtan University,Xiangtan,Hunan 411105,China
Abstract:Robust Optimization Problem(ROP) is one of the most important parts of Evolutionary Multiobjective Optimiza-tion(EMO).For most practical engineering optimization problems,the aim of them is to obtain robust optimal solutions.In this paper,the concept of Pareto in multiobjective optimization is employed to deal simultaneously with robustness and opti-mality.Therefore,a ROP is transformed into a biobjective problem,one of which is the robustness of solution and the other is the optimality of solution.Combining the characteristics of ROP and multi-objective optimization,a Multi-Objective Evolu-tionary Algorithm(MOEA) for solving ROPs is designed by dynamic weight strategy.By the several experiments on two ROP test problems,the results demonstrate that the proposed evolutionary multi-objective approach is efficient.
Keywords:Robust Optimization Problem(ROP)  Multi-Objective Evolutionary Algorithm(MOEA)  disturbance  robustness  optimality
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号