基于重新匹配策略的ε约束多目标分解优化算法

doi:10.3969/j.issn.0372-2112.2018.05.002

电子学报 ›› 2018, Vol. 46 ›› Issue (5): 1032-1040.DOI: 10.3969/j.issn.0372-2112.2018.05.002

基于重新匹配策略的ε约束多目标分解优化算法

张磊¹, 毕晓君², 王艳娇³

1. 长江大学电子信息学院, 湖北荆州 434000;
2. 哈尔滨工程大学信息与通信工程学院, 黑龙江哈尔滨 150000;
3. 东北电力大学信息工程学院, 吉林吉林 132012

收稿日期:2016-12-29 修回日期:2017-03-28 出版日期:2018-05-25
- 作者简介:
- 张磊男,1987年出生,湖北荆州人.长江大学电子信息学院讲师.研究方向为智能信息处理技术.E-mail:zl12306124@163.com;毕晓君 女,1964年出生,黑龙江哈尔滨人.哈尔滨工程大学信息与通信工程学院教授、博士生导师.研究方向为智能信息处理技术、数字图像处理.;王艳娇 女,1985年出生,吉林吉林人.东北电力大学信息工程学院副教授.研究方向为智能信息处理技术、进化算法.
- 基金资助:
- 国家自然科学基金 (No.61175126，No.61501107）; 长江大学青年基金 (No.7011502105）

The ε Constrained Multi-objective Decomposition Optimization Algorithm Based on Re-matching Strategy

ZHANG Lei¹, BI Xiao-jun², WANG Yan-jiao³

1. College of Electronics & Information, Yangtze University, Jingzhou, Hubei 434000, China;
2. College of Information and Communication Engineering, Harbin Engineering University, Harbin, Heilongjiang 510000, China;
3. College of Information Engineering, Northeast Electric Power University, Jilin, Jilin 132012, China

Received:2016-12-29 Revised:2017-03-28 Online:2018-05-25 Published:2018-05-25

摘要/Abstract

摘要： 针对MOEA/D算法中权重向量与个体分配不合理，导致种群多样性降低的问题，提出基于重新匹配策略的ε约束多目标分解优化算法.首先，对Tchebycheff分解策略进行理论分析，推导出关于多样性和收敛性的定理，从而为研究MOEA/D算法奠定理论基础.其次，为有效解决由于随机为权重向量分配个体造成种群多样性降低的问题，提出权重向量和个体间的重新匹配策略，合理地为权重向量分配个体，改善种群多样性.最后，提出的个体比较准则较好地兼顾多样性和收敛性，提高了算法的约束多目标优化性能.通过与5种优秀算法的对比实验结果表明，该文算法所求得的近似Pareto最优解集的分布性和收敛性均得到一定提高，相比于对比算法具有一定的优势.

关键词: 约束多目标优化, 分解策略, 重新匹配, ε约束

Abstract: Aiming at the problem that unreasonable distribution between weight vector and individual in MOEA/D reduce diversity,the ε constrained multi-objective decomposition optimization algorithm based on re-matching strategy is proposed.Firstly,through theoretical analysis of the chebycheff decomposition strategy,two theorems about diversity and convergence are gained,which could provide a theoretical basis for the research of MOEA/D.Secondly,in order to solve the problem of diversity reduction caused by random assignment of individual to weight vector,the re-matching strategy is presented for reasonably assigning individual to weight vector,and then diversity is improved.Finally,the suggested individual comparison criterion has a good balance between diversity and convergence,and it increases optimization performance.Comparative experiment results with five excellent algorithms show that our algorithm achieves better diversity and convergence,and our algorithm has a certain advantage.

Key words: constrained multi-objective optimization, decomposition strategy, re-matching, epsilon constraint

中图分类号:

TP18

张磊, 毕晓君, 王艳娇. 基于重新匹配策略的ε约束多目标分解优化算法[J]. 电子学报, 2018, 46(5): 1032-1040.

ZHANG Lei, BI Xiao-jun, WANG Yan-jiao. The ε Constrained Multi-objective Decomposition Optimization Algorithm Based on Re-matching Strategy[J]. Acta Electronica Sinica, 2018, 46(5): 1032-1040.

参考文献

[1] Zhang Q,Li H.MOEA/D:A multi-objective evolutionary algorithm based on decomposition[J].IEEE Transactions on Evolutionary Computation,2007,11(6):712-731.
[2] Lin Q,Li J,Du Z,et al.A novel multi-objective particle swarm optimization with multiple search strategies[J].European Journal of Operational Research,2015,247(3):732-744.
[3] Sun X,Chen Y,Liu Y,et al.Indicator-based set evolution particle swarm optimization for many-objective problems[J].Soft Computing,2016,20(6):2219-2232.
[4] 王亚辉,吴金妹,贾晨辉.基于动态种群多策略差分进化模型的多目标进化算法[J].电子学报,2016,44(6):1472-1480. Wang Yahui,Wu Jinmei,Jia Chenhui.Multi-objective evolutionary algorithm based on dynamic population multi-strategy differential models[J].Acta Electronica Sinica,2016,44(6):1472-1480.(in Chinese)
[5] Ma X,Liu F,Qi Y,et al.A multi-objective evolutionary algorithm based on decision variable analyses for multi-objective optimization problems with large-scale variables[J].IEEE Transactions on Evolutionary Computation,2016,20(2):275-298.
[6] Wagner M,Bringmann K,Friedrich T,et al.Efficient optimization of many objectives by approximation guided evolution[J].European Journal of Operational Research,2015,243(2):465-479.
[7] 张兴义,蒋小三,张磊.基于权值向量的偏好多目标优化方法[J].电子学报,2016,44(11):2639-2645. Zhang Xingyi,Jiang Xiaosan,Zhang Lei.A weight vector based multi-objective optimization algorithm with preference[J].Acta Electronica Sinica,2016,44(11):2639-2645.(in Chinese)
[8] 周爱民,张青富,张桂戌.一种基于混合高斯模型的多目标进化算法[J].软件学报,2014(5):913-928. Zhou Aiming,Zhang Qingfu,Zhang Guixu.Multiobjective evolutionary algorithm based on mixture gaussian models[J].Journal of Software,2014(5):913-928.(in Chinese)
[9] Zhu Q,Lin Q,Du Z,et al.A novel adaptive hybrid crossover operator for multi-objective evolutionary algorithm[J].Information Sciences An International Journal,2016,345(C):177-198.
[10] Jan M A,Khanum R A.A study of two penalty-parameterless constraint handling techniques in the framework of MOEA/D[J].Applied Soft Computing,2013,13(1):128-148.
[11] Woldesenbet Y G,Yen G G,Tessema B G.Constraint handling in multi-objective evolutionary optimization[J].IEEE Transactions on Evolutionary Computation,2009,13(3):514-525.
[12] Qiu X,Huang Y,Tan K C.A novel multi-objective optimization framework combining NSGA-Ⅱ and MOEA/D[A].Proceedings of Asia Pacific Symposium on Intelligent and Evolutionary Systems[C].Singapore:Springer,2015.227-237.
[13] Jan M A,Khanum R A,Tairan N M,et al.Performance of a constrained version of MOEA/D on CTP-series test instances[J].International Journal of Advanced Computer Science and Applications,2016,7(6):496-505.
[14] Qi Y,Ma X,Liu F,et al.MOEA/D with adaptive weight adjustment[J].Evolutionary Computation,2014,22(2):231-264.
[15] Liu H L,Li X.The multiobjective evolutionary algorithm based on determined weight and sub-regional search[A].IEEE Congress on Evolutionary Computation[C].Trondheim:IEEE,2009.1928-1934.
[16] Tseng L Y,Chen C.Multiple trajectory search for unconstrained/constrained multi objective optimization[A].IEEE Congress on Evolutionary Computation[C].Trondheim:IEEE,2009.1951-1958.
[17] Zhang Q,Zhou A,Zhao S,et al.Multiobjective optimization test instances for the CEC 2009 special session and competition[J].University of Essex,2008.
[18] Asafuddoula M,Ray T,Sarker R.An efficient constraint handling approach for optimization problems with limited feasibility and computationally expensive constraint evaluations[A].IEEE Conference on Genetic and Evolutionary Computation[C].Cancun:IEEE,2013.113-114.
[19] Tseng L Y,Chen C.Multiple trajectory search for unconstrained/constrained multi-objective optimization[A].IEEE Congress on Evolutionary Computation[C].Trondheim:IEEE,2009.1951-1958.
[20] Asafuddoula M,Ray T,Sarker R,et al.An adaptive constraint handling approach embedded MOEA/D[A].IEEE Congress on Evolutionary Computation[C].Brisbane:IEEE,2012.1-8.

基于重新匹配策略的ε约束多目标分解优化算法

The ε Constrained Multi-objective Decomposition Optimization Algorithm Based on Re-matching Strategy

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 4

编辑推荐

Metrics

[1]	崔玉亚, 张德干, 张婷, 杨鹏, 朱浩丽. 一种面向移动边缘计算的多用户细粒度任务卸载调度方法[J]. 电子学报, 2021, 49(11): 2202-2207.
[2]	章刚, 陈庆奎. GCTA:一种群组命令传输算法[J]. 电子学报, 2016, 44(2): 413-419.
[3]	章刚, 陈庆奎. GCTMHA:基于启发式群组命令传输模型[J]. 电子学报, 2016, 44(1): 233-235.
[4]	尚荣华;焦李成;马文萍;公茂果. 用于约束多目标优化的免疫记忆克隆算法[J]. 电子学报, 2009, 37(6): 1289-1294.