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

针对多目标优化的混和差分演化算法
引用本文:罗晶.针对多目标优化的混和差分演化算法[J].数字社区&智能家居,2009,5(1):227-229.
作者姓名:罗晶
作者单位:中国地质大学(武汉)计算机学院,湖北武汉430074
摘    要:作为一种简单而有效的新兴计算技术,差分演化算法(DE)已受到学术界和工程界的广泛关注,并且已经在多峰函数优化,数据过滤,多目标优化等十九个大方向上取得了许多成功应用。为此,对围绕差分演化算法的相关背景,原理、特点、改进等方面进行简单介绍.Hookeand Jeeves方法是一种经典的局部搜索算法,将其与差分演化算法结合来求解多目标优化问题,提高了解的收敛质量,因而从整体上提高了算法的性能,并且测试结果也说明了该算法的可行性。

关 键 词:差分演化  多目标优化  Pareto解Hooke  and  Jeeves搜索法

Research in Differential Evolution
LUO Jing.Research in Differential Evolution[J].Digital Community & Smart Home,2009,5(1):227-229.
Authors:LUO Jing
Affiliation:School of Computer;China University of Geosciences;Wuhan 430074;China
Abstract:As a novel evolutionary computing technique, differential evolution (DE) is simple and effective,which has already been applied succesively to many areas such as multimodal function optimization,neural network learning, digital filter design,multi_objective optimization and so on.A simple introduce on DE is presented in aspect of mechanism,feature and improvements. Hooke and Jeeves direct search method is a classical one, which is combined with DE, can improve DE s" convergence performance in the whole search process, and the test shows thismethod is feasible.
Keywords:Differential evolution  Multi_objective optimization  Pareto set  Hooke and Jeeves direct searchmethod  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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