广东工业大学 应用数学学院,广东,广州,510520
周怡璐(1992–),女,硕士研究生,主要研究方向为算法设计与分析、最优化理论与方法
李锋(1977–),男,讲师,主要研究方向为算法设计与分析,E-mail:lfgdutnews@126.com
网络首发:2018-07-09,
纸质出版:2018
移动端阅览
周怡璐, 王振友, 李叶紫, 李锋. MOEA/D聚合函数的二次泛化及其优化性能分析[J]. 广东工业大学学报, 2018, 35(4): 37-44.
Zhou Yi-lu, Wang Zhen-you, Li Ye-zi, et al. A Quadratic Scalarizing Function in MOEA/D and its Performance on Multi and Many-Objective Optimization[J]. 2018, 35(4): 37-44.
周怡璐, 王振友, 李叶紫, 李锋. MOEA/D聚合函数的二次泛化及其优化性能分析[J]. 广东工业大学学报, 2018, 35(4): 37-44. DOI: 10.12052/gdutxb.170147.
Zhou Yi-lu, Wang Zhen-you, Li Ye-zi, et al. A Quadratic Scalarizing Function in MOEA/D and its Performance on Multi and Many-Objective Optimization[J]. 2018, 35(4): 37-44. DOI: 10.12052/gdutxb.170147.
基于分解的多目标进化算法(Multi-objective Evolutionary Algorithm Based on Decomposition
MOEA/D)是多目标优化算法的一个重要分支
多目标优化的关键问题是如何在算法的收敛性和散布性之间达到良好的平衡. 目前主流算法的聚合函数存在着不同的优缺点
尤其是当使用切比雪夫方法选择个体时
经常出现个体偏离权重现象
个体和权重间得不到很好的粘合. 本文基于此提出了一种新的聚合函数方法
提高了MOEA/D的性能. 该聚合函数的函数形式为二次函数
种群个体在该函数下的等高线是一条二次曲线(本文称双曲线函数方法
Hyperbola Function Method
HYB)
是对目前存在的聚合函数的一种泛化形式. 该HYB方法相比PBI (Penalty-based Boundary Intersection)方法更强调收敛性
能更容易地在收敛性散布性之间达到平衡. 本文测试了MOKP问题及DTLZ系列等测试函数
并与其他算法进行了实验对比
结果显示HYB方法更稳定有效且种群在收敛速度上有一定的提高.
Multi-objective Evolutionary Algorithm Based on decomposition (MOEA/D) is an important branch. Achieving balance between convergence and diversity is a key issue in evolutionary multi-objective optimization. There are more or less deficiencies and shortcomings in the mainstream scalarizing functions. When using Tchebycheff to choose individuals
individuals often deviate from the weight and can not combine well with weight. On this basis
a new scalarizing function which improves performance of MOEA/D is presented. The scalarizing function is a quadratic function and its contour line is also a quadratic function (In this paper it is called Hyperbola function method
which is HYB.)
which is a generalization to the current scalarizing functions. Comparing with PBI
this algorithm has better convergence and the balance between convergence and diversity is easily obtained. After testing MOKP and series of DTLZ and comparing with other algorithms
HYB is shown to be stable and effective and to improve the speed of convergence.
SRINIVAS N, DEB K. Multiobjective optimization using nondominated sorting in genetic algorithms [J]. Evolutionary Computation, 1994, 2(3): 221-248.
ZITZLER E, LAUMANNS M, THIELE L. SPEA2: improving the performance of the strength pareto evolutionary algorithm [J]. Lecture Notes in Computer Science, 2004, 3242(4): 742-751.
DEB K, JAIN H. An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints [J]. IEEE Transactions on Evolutionary Computation, 2014, 18(4): 577-601.
ZITZLER E, KÜNZLI S. Indicator-based selection in multiobjective search [J]. Lecture Notes in Computer Science, 2004, 3242: 832-842.
BEUME N, NAUJOKS B, EMMERICH M. SMS-EMOA: multiobjective selection based on dominated hypervolume [J]. European Journal of Operational Research, 2007, 181(3): 1653-1669.
BADER J, ZITZLER E. HypE: an algorithm for fast hypervolume-based many-objective optimization [J]. Evolutionary Computation, 2011, 19(1): 45.
ZHANG Q, LI H. MOEA/D: a multiobjective evolutionary algorithm based on decomposition [J]. IEEE Trans Evol Comput, 2007, 11(6): 712-731.
LI H, ZHANG Q. Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II [J]. IEEE Transactions on Evolutionary Computation, 2009, 13(2): 284-302.
CHENG R, JIN Y, OLHOFER M, et al . A reference vector guided evolutionary algorithm for many-objective optimization [J ] . IEEE Transactions on Evolutionary Computation, 2016, 20(5): 773-791.
QI Y, MA X, LIU F, et al . MOEA/D with adaptive weight adjustmen [J ] . Evolutionary Computation, 2014, 22(2): 231-264.
ZHOU A, ZHANG Q. Are all the subproblems equally important? resource allocation in decomposition-based multiobjective evolutionary algorithms [J]. IEEE Transactions on Evolutionary Computation, 2016, 20(1): 52-64.
TRIVEDI A, SRINIVASAN D, SANYAL K, et al . A survey of multiobjective evolutionary algorithms based on decomposition [J ] . IEEE Transactions on Evolutionary Computation, 2017, 21(3): 440-462.
SATO H. Analysis of inverted PBI and comparison with other scalarizing functions in decomposition based MOEAs [J]. Journal of Heuristics, 2015, 21(6): 819-849.
ISHIBUCHI H, AKEDO N, NOJIMA Y. A study on the specification of a scalarizing function in MOEA/D for many-objective knapsack problems [J]. Proc of Learning and Intelligent Optimization 7 (LION 7), 2013, 7997: 231-246.
DEB K, THIELE L, LAUMANNS M.Scalable test problems for evolutionary multiobjective optimization[C]// Evolutionary Multiobjective Optimization. London: Springer London Ltd, 2005:105-145.
LI K, DEB K, ZHANG Q, et al . An evolutionary many-objective optimization algorithm based on dominance and decomposition [J ] . IEEE Transactions on Evolutionary Computation, 2015, 19(5): 694-716.
ZITZLER E, THIELE L. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach [J]. IEEE Transactions on Evolutionary Computation, 1999, 3(4): 257-271.
RUSSO L M S, FRANCISCO A P. Quick hypervolume [J]. IEEE Transactions on Evolutionary Computation, 2012, 18(4): 481-502.
ZITZLER E, THIELE L, LA UMANNS M, et al . Performance assessment of multiobjective optimizers: an analysis and review [J ] . IEEE Transactions on Evolutionary Computation, 2003, 7(2): 117-132.
0
浏览量
0
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621