多目标优化非支配集构造方法的研究进展

计算机工程与应用 ›› 2013, Vol. 49 ›› Issue (19): 31-35.

多目标优化非支配集构造方法的研究进展

李志强，蔺想红

西北师范大学计算机科学与工程学院，兰州 730070

出版日期:2013-10-01 发布日期:2015-04-20

Research advance of multi-objective optimization non-dominated set construction methods

LI Zhiqiang, LIN Xianghong

School of Computer Science and Engineering, Northwest Normal University, Lanzhou 730070, China

Online:2013-10-01 Published:2015-04-20

摘要/Abstract

摘要： 多目标优化非支配集的构造是多目标进化算法研究领域的一个重要步骤，旨在研究用多目标进化算法解决多目标优化问题的效率。对多目标优化问题进行了描述并且给出了求解算法的一般框架，结合研究现状讨论了目前该领域几种主要的基于Pareto非支配集的构造算法，以及它们的计算时间复杂度；总结并展望了该领域未来的发展趋势。

关键词: 多目标进化算法（MOEA）, 多目标优化问题（MOP）, 非支配集, Pareto前沿

Abstract: Constructing the multi-objective optimization non-dominated set is an important step in the Multi-Objective Evolutionary Algorithm（MOEA）. It aims to study the operational efficiency to solve Multi-objective Optimization Problem（MOP） by MOEA. Firstly, the MOP is described as well as the basic framework of solving algorithm is given. Next, several non-dominated set building methods based on Pareto are discussed including their computational complexity. Finally, the future trends of this research filed are concluded and prospected.

Key words: Multi-Objective Evolutionary Algorithm（MOEA）, Multi-objective Optimization Problem（MOP）, non-dominated set, Pareto front

李志强，蔺想红. 多目标优化非支配集构造方法的研究进展[J]. 计算机工程与应用, 2013, 49(19): 31-35.

LI Zhiqiang, LIN Xianghong. Research advance of multi-objective optimization non-dominated set construction methods[J]. Computer Engineering and Applications, 2013, 49(19): 31-35.

[1]	胡小兵，陈树念，张盈斐，谷升豪. 求解多目标路径优化问题的涟漪扩散算法[J]. 计算机工程与应用, 2021, 57(23): 81-90.
[2]	管月智，葛洪伟. 一种混合的多目标粒子群算法[J]. 计算机工程与应用, 2012, 48(6): 42-45.
[3]	彭琰,郑金华. 基于随机算子的快速多目标遗传算法[J]. 计算机工程与应用, 2007, 43(33): 54-57.