期刊文献+

动态多目标优化研究综述 被引量:37

A Survey on Dynamic Multi-Objective Optimization
下载PDF
导出
摘要 现实生活中,存在许多动态多目标优化问题(Dynamic Multi-objective Optimization Problems,DMOPs),这类问题的目标函数之间相互矛盾,并且目标函数、约束或者参数都可能随着时间的变化而发生变化.这种随时间不断变化的特性,给解决DMOPs带来了挑战,算法不仅要能够追踪到最优解,同时还要求算法能够快速地对发生的变化做出响应.本文对动态多目标优化(Dynamic Multi-objective Optimization,DMO)的研究进行了比较全面的综述,具体内容如下:(1)描述了DMO的相关理论背景;(2)阐述了DMOPs的分类并对现有的基准问题做了分类归纳;(3)详细讨论了DMO研究的发展概况;(4)对DMO算法的性能评价指标进行了归类介绍;(5)通过实验对比了主流DMO算法的性能;(6)总结了DMO算法在一些领域的应用;(7)分析了解决DMOPs存在的挑战以及诸多难题. In real life,there are many dynamic multi-objective optimization problems(DMOPs),in which the objective functions restrict each other and the objective functions,constraints or parameters may change over time.This changing property with time brings challenges to solving DMOPs.The algorithm not only needs to track the optimal solution,but also needs to respond to changes in the environment quickly.This paper gives a comprehensive review of the research on dynamic multi-objective optimization(DMO),including the following contents.(1)This paper first introduces the relevant theoretical background of DMO,including the definition of DMOP,the definition of Pareto-optimal set(PS)and Pareto-optimal front(PF).(2)This paper shows the classification of DMOPs and summarizes the existing benchmark functions according to the different characteristics of problems,for instance the change types,the shape of PS or the shape of PF,the relationship between the variables,change in the number of objective functions,change in the dimension of the decision vectors,whether there are constraints and so on.(3)Based on the simple analysis of general framework of solving DMOPs,this paper discusses the research status of the dynamic multi-objective optimization algorithms(DMOAs)in detail.When solving a DMOP,if the environment changes,the algorithm must be able to detect the changes of environment sensitively and respond to the changes occurred in the environments effectively;if the environment does not change,the algorithm should track the Pareto optimal solutions of the current environment as quickly and accurately as possible.Therefore,an environmental change detection operator,an environmental change response strategy and an excellent static multi-objective optimization algorithm are three indispensable parts of a DMOA.Thus,the discussion of the status of DMOAs also based on the above three parts.Specially,the review of response strategies mainly includes the diversity introduction strategy,diversity maintenance strategy,prediction strategy,memory-based strategy,self-adaptive response strategy and some new response strategies based on special models such as transfer learning and support vector machine.It is worth noting that we have analyzed the advantages and disadvantages of each method.(4)The main purpose of performance evaluation is to evaluate the convergence and diversity of DMOAs.In this paper,the performance metrics are classified and introduced according to whether the metric is for evaluation convergence,evaluation diversity or comprehensive evaluation convergence and diversity.(5)This paper compares the performance of some mainstream DMOAs through empirical studies,finding each algorithm has more or less shortcomings and cannot solve every DMOP perfectly.(6)This paper summarizes some practical application cases of DMOAs,such as control problem,scheduling problem,mechanical design problem,image segmentation problem,resource management problem,path optimization problem.(7)Finally,this paper proposes the challenges and the existing problems in solving the DMOPs.On one hand,it is difficult to design efficient and effective environmental change detection operators and environmental change response strategies to solve some complex DMOPs.On the other hand,the research of DMO and practical application are disconnect,most of the existing DMOAs can only handle theoretical DMOPs.
作者 刘若辰 李建霞 刘静 焦李成 LIU Ruo-Chen;LI Jian-Xia;LIU Jing;JIAO Li-Cheng(Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education,Xidian University,Xi’an 710071)
出处 《计算机学报》 EI CSCD 北大核心 2020年第7期1246-1278,共33页 Chinese Journal of Computers
基金 国家自然科学基金(61876141,61373111,61672405,61871306) 陕西省自然科学基金(2019JZ-26)资助.
关键词 动态多目标优化 多目标优化 PARETO最优 测试函数 性能指标 实际应用 dynamic multi-objective optimization multi-objective optimization Pareto optimal benchmark functions performance metrics practical application
  • 相关文献

参考文献6

二级参考文献104

  • 1姚新,徐永.Recent Advances in Evolutionary Computation[J].Journal of Computer Science & Technology,2006,21(1):1-18. 被引量:30
  • 2江淑红,汪沁,张建秋,胡波.基于目标中心距离加权和图像特征识别的跟踪算法[J].电子学报,2006,34(7):1175-1180. 被引量:12
  • 3Cai Huaiping Liu Jingxu Chen Yingwu Wang Hao.Survey of the research on dynamic weapon-target assignment problem[J].Journal of Systems Engineering and Electronics,2006,17(3):559-565. 被引量:45
  • 4刘淳安,王宇平.动态多目标优化的进化算法及其收敛性分析[J].电子学报,2007,35(6):1118-1121. 被引量:21
  • 5Farina M, Deb K, Amato P. Dynamic multiobjective optimization problems: Test cases, approximations, and applications EJ~. IEEE Trans on Evolutionary Computation, 2004, 8(5): 425-442.
  • 6Greeff M, Engelbrecht A P. Solving dynamic multi objective problems with vector evaluated particle swarm optimization [C] //Proc of Congress on Evolutionary Computation. Piscataway, NJ: IEEE, 2008 : 2917-2924.
  • 7Talukder AKMKA, Kirley M. A pareto following variation operator for evolutionary dynamic multi-objective optimization [C] //Proc of Congress on Evolutionary Computation. Piscataway, NJ: IEEE, 2008:2270-2277.
  • 8ChiKeong G, Chen T K. A competitive-cooperative coevolutionary paradigm for dynamic multiobjective optimization [J]. IEEE Trans on Evolutionary Computation, 2009, 13(1): 103-127.
  • 9Potter M A. The design and analysis of a computational model of cooperative coevolution [D]. Fairfax, VA: George Mason University, 1997.
  • 10van den Bergh F, Engelbreeht A P. A cooperative approach to particle swarm optimization [J].IEEE Trans on Evolutionary Computation, 2004, 8(3): 225-239.

共引文献81

同被引文献304

引证文献37

二级引证文献101

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部