Large-scale multiobjective optimization problems (LSMOPs) are characterized as involving hundreds or even thousands of decision variables and multiple conflicting objectives. An excellent algorithm for solving LSMOPs should find Pareto-optimal solutions with diversity and escape from local optima in the large-scale search space. Previous research has shown that these optimal solutions are uniformly distributed on the manifold structure in the low-dimensional space. However, traditional evolutionary algorithms for solving LSMOPs have some deficiencies in dealing with this structural manifold, resulting in poor diversity, local optima, and inefficient searches. In this work, a generative adversarial network (GAN)-based manifold interpolation framework is proposed to learn the manifold and generate high-quality solutions on this manifold, thereby improving the performance of evolutionary algorithms. We compare the proposed algorithm with several state-of-the-art algorithms on large-scale multiobjective benchmark functions. Experimental results have demonstrated the significant improvements achieved by this framework in solving LSMOPs.
翻译:大型多目标优化问题(LSMOPs)被定性为涉及数百甚至数千个决定变量和多重相互冲突的目标。解决LSMOPs的极好算法应该找到具有多样性和在大规模搜索空间脱离本地opima的优质解决方案。以前的研究表明,这些最佳解决方案在低维空间的多层结构上均匀分布。然而,解决LSOPs的传统进化算法在处理这一结构元体方面有一些缺陷,导致多样性差、本地opima和低效率搜索。在这项工作中,提议了一个基于基因对抗网络的多极化多极化框架,以学习多元并生成高质量的解决方案,从而改进进化算法的性能。我们将这些拟议的算法与关于大型多目标基准功能的一些最先进的算法进行了比较。实验结果表明,这一框架在解决LSMOPs方面有了重大改进。