基于改进平衡策略的多目标分解优化算法

doi:10.19678/j.issn.1000-3428.0050049

摘要/Abstract

摘要：

针对多目标优化算法在搜索中存在平衡解的收敛性和多样性问题,通过分析多目标分解进化算法,提出2种改进平衡策略。基于当前解和父代解的取值,设计繁殖算子,并与原有繁殖算子进行比较选出最优解。根据执行代数的不同,对邻居集合进行适应性调整。在此基础上,给出多目标分解进化算法。实验结果验证了2种平衡策略的有效性,同时该算法性能优于MOEA/D算法、NSGAII算法和IBEA算法。

关键词: 多目标优化, 进化计算, 分解方法, 平衡策略, 繁殖算子, 邻居集合

Abstract:

Aiming at the problem that the Multi-objective Optimization(MOP) algorithm has the convergence and diversity problem of the equilibrium solution in the search,two improved balancing strategies have been proposed by analyzing multi-objective decomposition evolutionary algorithms.Based on the values of the current solution and the parent solution,a breeding operator is designed and compared with the original breeding operator to select the optimal solution.The set of neighbors is adaptively changed according to the execution algebra.On this basis,a multi-objective decomposition evolution algorithm is given.Experimental results verify the effectiveness of the two balancing strategies,and the algorithm is better than the MOEA/D algorithm,NSGAII algorithm and IBEA algorithm.

Key words: Multi-objective Optimization(MOP), evolutionary computing, decomposition method, balancing strategy, reproduction operator, neighborhood set

中图分类号:

TP391

李智翔,李赟,褚衍杰. 基于改进平衡策略的多目标分解优化算法[J]. 计算机工程, 2019, 45(3): 155-161.

LI Zhixiang,LI Yun,CHU Yanjie. Decomposition Multi-objective Optimization Algorithm Based on Improved Balancing Strategy[J]. Computer Engineering, 2019, 45(3): 155-161.

http://www.ecice06.com/CN/Y2019/V45/I3/155

参考文献

［1］HANNE T,NICKEL S.A multiobjective evolutionary algorithm for scheduling and inspection planning in software development projects［J］.European Journal of Operational Research,2005,167(3):663-678.
［2］SNCHEZ L,OTERO J,COUSO I.Obtaining linguistic fuzzy rule-based regression models from imprecise data with multiobjective genetic algorithms［J］.Soft Computing,2009,13(5):467-479.
［3］BELFARES L,KLIBI W,LO N,et al.Multi-objectives Tabu search based algorithm for progressive resource allocation［J］.European Journal of Operational Research,2007,177(3):1779-1799.
［4］GIAGKIOZIS I,PURSHOUSE R C,FLEMING P J.An overview of population-based algorithms for multi-objective optimisation［J］.International Journal of Systems Science,2015,46(9):1572-1599.
［5］DEB K,PRATAP A,AGARWAL S,et al.A fast and elitist multiobjective genetic algorithm:NSGA-II［J］.IEEE Transactions on Evolutionary Computation,2002,6(2):182-197.
［6］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.
［7］ZHANG Q,LI H.MOEA/D:a multiobjective evolutionary algorithm based on decomposition［J］.IEEE Transactions on Evolutionary Computation,2007,11(6):712-731.
［8］刘超,贺利军,朱光宇.基于熵和隶属度函数的高维多目标优化问题求解［J］.计算机工程,2016,42(6):185-190.
［9］ZHANG Q,LIU W,LI H.The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances［C］//Proceedings of the 7th Conference on Congress on Evolutionary Computation.Washington D.C.,USA:IEEE Press,2009:203-208.
［10］LI K,ZHANG Q,KWONG S,et al.Stable matching-based selection in evolutionary multiobjective optimization［J］.IEEE Transactions on Evolutionary Computation,2014,18(6):909-923.
［11］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.
［12］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.
［13］GIAGKIOZIS I,PURSHOUSE R C,FLEMING P J.An overview of population-based algorithms for multi-objective optimisation［J］.International Journal of Systems Science,2015,46(9):1572-1599.
［14］WU M,LI K,KWONG S,et al.Matching-based selection with incomplete lists for decomposition multiobjective optimization［J］.IEEE Transactions on Evolutionary Computation,2017,21(4):554-568.
［15］LIU H L,GU F,ZHANG Q.Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems［J］.IEEE Transactions on Evolutionary Computation,2014,18(3):450-455.
［16］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.
［17］GONCALVES R A,ALMEIDA C P,POZO A.Upper confidence bound algorithms for adaptive operator selection in MOEA/D［C］//Proceedings of the 8th International Conference on Evolutionary Multi-Criterion Optimization.Berlin,Germany:Springer,2015:411-425.
［18］GIAGKIOZIS I,PURSHOUSE R C,FLEMING P J.Generalized decomposition and cross entropy methods for many-objective optimization［J］.Information Sciences,2014,282:363-387.
［19］MA X,ZHANG Q,YANG J,et al.On tchebycheff decomposition approaches for multi-objective evolutionary optimization［J］.IEEE Transactions on Evolutionary Computation,2017,22(2):226-244.
［20］LI Y L,ZHOU Y R,ZHAN Z H,et al.A primary theoretical study on decomposition-based multiobjective evolutionary algorithms［J］.IEEE Transactions on Evolutionary Computation,2016,20(4):563-576.
［21］ZITZLER E,KNZLI S.Indicator-based selection in multiobjective search［C］//Proceedings of the 8th International Conference on Parallel Problem Solving from Nature.Berlin,Germany:Springer,2004:832-842.
［22］DEB K,THIELE L,LAUMANNS M,et al.Scalable multi-objective optimization test problems［C］//Proceedings of Congress on Evolutionary Computation.Washington D.C.,USA:IEEE Press,2002:825-830.
［23］ZHANG Q,ZHOU A,ZHAO S,et al.Multiobjective optimization test instances for the CEC 2009 special session and competition ［EB/OL］.［2017-12-20］.https://dces.essex.ac.uk/staff/zhang/MOEAcompetition/cec09testproblem0904.pdf .
［24］BOSMAN P A N,THIERENS D.The balance between proximity and diversity in multiobjective evolutionary algorithms［J］.IEEE Transactions on Evolutionary Computation,2003,7(2):174-188.

[1]	蔡星娟, 郭彦亨, 赵天浩, 张文生. 基于进化多任务的边缘计算服务部署和任务卸载[J]. 计算机工程, 2023, 49(7): 1-9.
[2]	刘子怡, 王宇嘉, 孙福禄, 贾欣, 聂方鑫. 结合特征扰动与分配策略的集成辅助多目标优化算法[J]. 计算机工程, 2022, 48(6): 115-123.
[3]	张然, 高莹雪, 赵钰, 丁元明. 基于Q学习量子蚁群的微纳卫星路由算法[J]. 计算机工程, 2022, 48(3): 162-169,188.
[4]	宋佳艳, 苏圣超. 基于改进蚁群优化算法的自动驾驶多车协同运动规划[J]. 计算机工程, 2022, 48(11): 299-305,313.
[5]	东熠, 刘景发, 刘文杰. 基于多目标蚁群算法的主题爬虫策略[J]. 计算机工程, 2020, 46(9): 274-282.
[6]	刘颖, 王聪, 苑迎, 蒋国佳, 刘珂祯, 王翠荣. 基于Pareto熵的多目标虚拟网络映射算法[J]. 计算机工程, 2020, 46(8): 153-159.
[7]	刘景发,李新,蒋盛益. 基于网页空间进化算法的暴雨灾害主题爬虫策略[J]. 计算机工程, 2019, 45(2): 184-190.
[8]	张煜培,赵知劲,郑仕链. 基于多目标遗传的频谱切换目标信道序列设计算法[J]. 计算机工程, 2019, 45(2): 122-128.
[9]	邵先成,蔡超,王厚军,李东武. 基于二型模糊集推理的优化航路规划方法[J]. 计算机工程, 2018, 44(3): 287-293.
[10]	王林,胡雪婷. 基于多决策属性的社会网络核心节点识别[J]. 计算机工程, 2018, 44(1): 206-210.
[11]	曹道通,李敬文,文飞. 图的Smarandachely邻点可区别边染色算法[J]. 计算机工程, 2017, 43(9): 228-233,239.
[12]	吴琼,曾庆鹏. 基于多目标烟花优化算法的正负量化关联规则挖掘[J]. 计算机工程, 2017, 43(6): 158-168.
[13]	刘璐,郑力明. 基于邻域和变异算子组合优化的MOEA/D算法[J]. 计算机工程, 2017, 43(3): 232-240.
[14]	刘超,贺利军,朱光宇. 基于熵和隶属度函数的高维多目标优化问题求解[J]. 计算机工程, 2016, 42(6): 185-190,195.
[15]	吴响,张鉴,邓笋根,陆忠华,胡晓东. 并行飞机气动模拟工作台软件[J]. 计算机工程, 2016, 42(4): 31-36.

选择文件类型/文献管理软件名称

选择包含的内容