IEEE Trans Cybern. 2021 Oct;51(10):4968-4981. doi: 10.1109/TCYB.2020.3017049. Epub 2021 Oct 12.
Dynamic multiobjective optimization problems (DMOPs) are characterized by optimization functions that change over time in varying environments. The DMOP is challenging because it requires the varying Pareto-optimal sets (POSs) to be tracked quickly and accurately during the optimization process. In recent years, transfer learning has been proven to be one of the effective means to solve dynamic multiobjective optimization. However, the negative transfer will lead the search of finding the POS to a wrong direction, which greatly reduces the efficiency of solving optimization problems. Minimizing the occurrence of negative transfer is thus critical for the use of transfer learning in solving DMOPs. In this article, we propose a new individual-based transfer learning method, called an individual transfer-based dynamic multiobjective evolutionary algorithm (IT-DMOEA), for solving DMOPs. Unlike existing approaches, it uses a presearch strategy to filter out some high-quality individuals with better diversity so that it can avoid negative transfer caused by individual aggregation. On this basis, an individual-based transfer learning technique is applied to accelerate the construction of an initial population. The merit of the IT-DMOEA method is that it combines different strategies in maintaining the advantages of transfer learning methods as well as avoiding the occurrence of negative transfer; thereby greatly improving the quality of solutions and convergence speed. The experimental results show that the proposed IT-DMOEA approach can considerably improve the quality of solutions and convergence speed compared to several state-of-the-art algorithms based on different benchmark problems.
动态多目标优化问题 (DMOP) 的特点是优化函数随时间在不同环境中变化。DMOP 具有挑战性,因为它要求在优化过程中快速准确地跟踪变化的 Pareto 最优集 (POS)。近年来,迁移学习已被证明是解决动态多目标优化的有效手段之一。然而,负迁移会导致寻找 POS 的搜索方向错误,从而大大降低解决优化问题的效率。因此,尽量减少负迁移的发生对于在解决 DMOP 中使用迁移学习至关重要。在本文中,我们提出了一种新的基于个体的迁移学习方法,称为基于个体迁移的动态多目标进化算法 (IT-DMOEA),用于解决 DMOP。与现有方法不同,它使用预搜索策略来筛选出一些具有更好多样性的高质量个体,从而可以避免个体聚集引起的负迁移。在此基础上,应用基于个体的迁移学习技术来加速初始种群的构建。IT-DMOEA 方法的优点在于它结合了不同的策略,既能保持迁移学习方法的优势,又能避免负迁移的发生;从而大大提高了解的质量和收敛速度。实验结果表明,与基于不同基准问题的几种最先进的算法相比,所提出的 IT-DMOEA 方法可以显著提高解的质量和收敛速度。