Please wait a minute...
浙江大学学报(工学版)
计算机技术、信息工程     
新的混合分解高维多目标进化算法
过晓芳,王宇平,代才
1. 西安电子科技大学 计算机学院,陕西 西安 710071;
2. 西安工业大学 理学院,陕西 西安 710032
New hybrid decomposition many-objective evolutionary algorithm
GUO Xiao fang, WANG Yu ping, DAI Cai
1. School of Computer, Xidian University, Xi'an 710071, China;
2. School of Science, Xi'an Technological University, Xi'an 710032, China
 全文: PDF(866 KB)   HTML
摘要:

在基于分解技术求解高维多目标优化问题的思想启发下,为了提高多目标优化问题非支配解集合的分布性和收敛性,提出新的基于个体支配关系的混合分解高维多目标进化算法.该算法采用分子种群的进化模式,设计新的基于有效阶的个体支配关系用于个体的比较和更新操作,以便在增加个体选择压力的同时提高解集分布的多样性.为了改善该算法的局部搜索性能,将Powell搜索作为局部搜索算子,采用传统优化与进化算法相融合的混合进化策略.为了检验提出算法的性能,将提出算法用于求解5~20个目标的6类标准测试问题,与同类算法相比,该算法在收敛性和分布性方面均具有较大的改进和提高.

Abstract:

A hybrid decomposition many-objective evolutionary algorithm based on a new dominance relation was proposed inspired by many-objective evolutionary algorithms based on decomposition in order to improve the diversity and convergence of the non-dominated solution set in manyobjective optimization problems. The sub-population evolutionary pattern was adopted,  and a new efficiency order based dominance relation was designed to compare and update individuals inside each subpopulation, which helps to increase selective pressure and improve diversity. Powell search was used as the local search operator in order to improve the performance of local search. A hybrid evolution strategy combining traditional optimization method with evolutionary algorithm was adopted. Six standard benchmark problems with 5 to 20 objectives were tested to demonstrate the effectiveness of the  algorithm. Experimental results showed that the  algorithm performed better than other available algorithms in convergence and diversity.

出版日期: 2016-07-23
:  TP 301  
基金资助:

国家自然科学基金资助项目(61472297,61272119,61402350,61502290); 陕西省教育厅专项科研资助项目(16JK1381).

作者简介: 过晓芳(1981-),女,博士,讲师,从事多目标进化算法的研究. ORCID: 0000-0002-8944-3400. E-mail: gxfang1981@126.com
服务  
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章  

引用本文:

过晓芳,王宇平,代才. 新的混合分解高维多目标进化算法[J]. 浙江大学学报(工学版), 10.3785/j.issn.1008-973X.2016.07.013.

GUO Xiao fang, WANG Yu ping, DAI Cai. New hybrid decomposition many-objective evolutionary algorithm. JOURNAL OF ZHEJIANG UNIVERSITY (ENGINEERING SCIENCE), 10.3785/j.issn.1008-973X.2016.07.013.

链接本文:

http://www.zjujournals.com/eng/CN/10.3785/j.issn.1008-973X.2016.07.013        http://www.zjujournals.com/eng/CN/Y2016/V50/I7/1313

[1] CHRISTIAN V L.A survey on multiobjective evolutionary algorithms for manyobjective problems [J]. Computational Optimization and Applications, 2014, 58(3):707-756.
[2] 公茂果,焦李成,杨咚咚,等. 进化多目标优化算法研究[J]. 软件学报,2009, 2(20): 271-289.
GONG Maoguo, JIAO Licheng, YANG Dongdong, et al. Research on evolutionary multiobjective optimization algorithms [J]. Journal of Software, 2009, 2(20): 271-289.
[3] 孔维健. 高维多目标进化算法研究综述[J]. 控制与决策, 2010,25(3):321-326.
KONG Weijian. Survey on largedimensional multiobjective evolutionary algorithms [J]. Control and Decision, 2010, 25(3): 321-326.
[4] 巩敦卫. 基于集合的高维多目标优化问题的进化算法[J]. 电子学报, 2014, 42(1): 77-83.
GONG Dunwei. Solving manyobjective optimization problems using setbased evolutionary algorithms [J]. Acta Electronica Sinica, 2014, 42(1): 77-83.
[5] PIERRO D F, KHU S T, SAVIC D A.An investigation on preference order ranking scheme for multiobjective evolutionary optimization [J]. IEEE Transactions on Evolutionary Computation, 2007, 11(1): 17-45.
[6] ZOU Xiufen, CHEN Yu, LIU Minzhong. A new evolutionary algorithm for solving manyobjective optimization problems [J]. IEEE Transactions on Systems, Man, and Cybernetics, part BCybernetics, 2008, 38(5): 1402-1412.
[7] MOLINA J, SANTANA L, HERNANDEZDIAZ A, et al. Gdominance: reference point based dominance for multiobjective metaheuristics [J]. European Journal of Operational Research, 2009, 197(2): 685-692.
[8] 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.
[9] YUAN Yuan, HUA Xu, WANG Bo.A new dominance relation based evolutionary algorithm for manyobjective optimization [J]. IEEE Transactions on Evolutionary Computation, 2016,20(1): 16-37.
[10] ZITZLER E, SIMON K. Indicatorbased selection in multiobjective search [C]∥ Conference on Parallel Problem Solving from Nature (PPSN VIII). UK: Springer, 2004: 832-842.
[11] 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.
[12] WHILE L, BRADSTREET L, BARONE L.A fast way of calculating exact hypervolumes [J]. IEEE Transactions on Evolutionary Computation, 2012, 16(1): 86-95.
[13] ZHANG Q, LI H. MOEA/D: a multiobjective evolutionary algorithm based on decomposition [J]. IEEE Transactions on Evolutionary Computation, 2007, 11(6): 712-731.
[14] TAN Yanyan, JIAO Yongchang, LI Hong. MOEA/D +uniform design: a new version of MOEA/D for optimization problems with many objectives [J]. Computers and Operations Research, 2013, 40(6): 1648-1660.
[15] JIANG S, CAI Z, ZHANG J, et al. Multiobjective optimization by decomposition with Paretoadaptive weight vectors [C]∥ Proceeding of 7th International Conference on Natural Computation. Shanghai: IEEE, 2011: 1260-1264.
[16] 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.
[17] ZHOU A, ZHANG Q, ZHANG G. A multiobjective evolutionary algorithm based on decomposition and probability model [C]∥ IEEE Congress on Evolutionary Computation. [S.l.]: IEEE, 2012: 18.
[18] QI Y. MOEA/D with adaptive weight adjustment [J]. Evolutionary Computation, 2014, 22(2): 231-264.
[19] LIU Hailin, GU Fangqing, ZHANG Qingfu. Decomposition of a multiobjective optimization problems into a number of simple multiobjective subproblems [J].  IEEE Transactions on Evolutionary Computation, 2014, 18(3): 450-455.
[20] Deb K, THIELE L, LAUMANNS M, et al. Scalable multiobjective optimization test problems [C]∥IEEE Congress on Evolutionary Computation (CEC’02). [S.l.]: IEEE, 2002: 825-830.
[21] ZHANG Q, ZHOU A, ZHAO S, et al. Multiobjective optimization test instances for the CEC 2009 special session and competition [R]. Clemson: University of Essex, 2008.
[22] 代才. 基于分解的多目标进化算法研究[D]. 西安:西安电子科技大学,2014: 50-70.
DAI Cai. Research on evolutionary algorithms based on decomposition for manyobjective optimization problems [D]. Xi'an: Xidian University, 2014: 50-70.
[23] ZITZLER E, LAUMANNS M, THIELE L. Performance assessment of multiobjective optimizers: analysis and review [J]. IEEE Transactions on Evolutionary Computation, 2003, 7(2): 117133.

[1] 毛宜钰, 刘建勋, 胡蓉, 唐明董. 基于Logistic函数和用户聚类的协同过滤算法[J]. 浙江大学学报(工学版), 2017, 51(6): 1252-1258.
[2] 张丽娜, 余阳. 海量O2O服务组合的优化[J]. 浙江大学学报(工学版), 2017, 51(6): 1259-1268.
[3] 董立岩, 朱琪, 李永丽. 基于最大共识的模型组合算法[J]. 浙江大学学报(工学版), 2017, 51(2): 416-421.
[4] 张小骏, 刘志镜, 李杰. 基于图像处理思想的激波捕捉自适应网格方法[J]. 浙江大学学报(工学版), 2017, 51(1): 89-94.
[5] 易树平, 刘觅, 温沛涵. 面向智能车间的工艺规划辅助决策方法[J]. 浙江大学学报(工学版), 2016, 50(10): 1911-1921.
[6] 张震, 潘再平, 潘晓弘. 骨干粒子群算法两种不同实现的优化特性[J]. 浙江大学学报(工学版), 2015, 49(7): 1350-1357.
[7] 苗峰,谢安桓,王富安,喻峰,周华. 多阶段可替换分组并行机调度问题的求解[J]. 浙江大学学报(工学版), 2015, 49(5): 866-872.
[8] 刘杰, 王宇平. 一种基于单纯形法的改进中心引力优化算法[J]. 浙江大学学报(工学版), 2014, 48(12): 2115-2122.
[9] 刘杰, 王宇平. 一种基于单纯形法的改进中心引力优化算法[J]. 浙江大学学报(工学版), 2014, 48(7): 2-.
[10] 斯袁杰,桂林,杨小虎. 模型验证中的公平性问题[J]. 浙江大学学报(工学版), 2014, 48(7): 1217-1225.
[11] 孔勇奇, 潘志庚. 基于抽风矢量场的深度凹陷图像分割算法[J]. 浙江大学学报(工学版), 2014, 48(6): 1024-1033.
[12] 倪广翼, 章孝灿, 苏程, 俞伟斌. 基于多染色体演化的自适应类别数聚类方法[J]. 浙江大学学报(工学版), 2014, 48(6): 980-986.
[13] 刘加海,杨茂林,雷航,廖勇. 共享资源约束下多核实时任务分配算法[J]. J4, 2014, 48(1): 113-117.
[14] 赵诗奎, 方水良, 顾新建. 柔性车间调度的新型初始机制遗传算法[J]. J4, 2013, 47(6): 1022-1030.
[15] 宋杰, 侯泓颖, 王智, 朱志良. 云计算环境下改进的能效度量模型[J]. J4, 2013, 47(1): 44-52.