高维目标减少算法  

Multi-objectives reduction algorithm

作　　者：陈静[1] 周聪[1] 李珂[1] 郑金华[1] 

机构地区：[1]湘潭大学信息工程学院,湖南湘潭411105

出　　处：《计算机工程与应用》2010年第11期38-41,94,共5页Computer Engineering and Applications

基　　金：国家自然科学基金No.6997403;湖南省自然科学基金No.05JJ30125~~

摘　　要：在多目标优化中,许多实际问题都是由很多目标(超过三个)所组成,但是目前提出的大多数算法却只有在三维以下时高效。由于超过三维的情况无法用欧式空间来表示,而且在处理高维问题时,算法的时间复杂度通常很高,因此人们开始考虑将高维目标转化为低维目标后再处理。首先介绍了目前已经存在的将高维目标转化为低维目标的算法,提出了一种新的算法,该方法通过数据拟合,将各目标函数拟合为一条直线,比较相互之间的斜率之差来确定目标是否存在冗余,以期减少冗余目标。In the real-world applications,multi-objectives optimization involve a large number of objective,however,existing algorithms are only efficient to the problems with no more than three objectives.Because the inability to be represented in the Euclidean space as it is more than 3 objectives,and the high computation complexity,researchers fall to doing with how to transform large objectives to the smaller ones.In this paper,some existed algorithms on transforming high-dimensional to low-dimensional are introduced,and then a new algorithm is proposed.This method fits every objective function to a line,and compares the slope differences between each two lines,finally makes certain which one is redundancy and further reduces this one.

关 键 词：多目标优化 冗余目标减少 数据拟合 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]