当前位置: X-MOL 学术Evol. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Uncrowded Hypervolume-Based Multiobjective Optimization with Gene-Pool Optimal Mixing
Evolutionary Computation ( IF 6.8 ) Pub Date : 2022-09-01 , DOI: 10.1162/evco_a_00303
S C Maree 1 , T Alderliesten 2 , P A N Bosman 3
Affiliation  

Domination-based multiobjective (MO) evolutionary algorithms (EAs) are today arguably the most frequently used type of MOEA. These methods, however, stagnate when the majority of the population becomes nondominated, preventing further convergence to the Pareto set. Hypervolume-based MO optimization has shown promising results to overcome this. Direct use of the hypervolume, however, results in no selection pressure for dominated solutions. The recently introduced Sofomore framework overcomes this by solving multiple interleaved single-objective dynamic problems that iteratively improve a single approximation set, based on the uncrowded hypervolume improvement (UHVI). It thereby however loses many advantages of population-based MO optimization, such as handling multimodality. Here, we reformulate the UHVI as a quality measure for approximation sets, called the uncrowded hypervolume (UHV), which can be used to directly solve MO optimization problems with a single-objective optimizer. We use the state-of-the-art gene-pool optimal mixing evolutionary algorithm (GOMEA) that is capable of efficiently exploiting the intrinsically available grey-box properties of this problem. The resulting algorithm, UHV-GOMEA, is compared with Sofomore equipped with GOMEA, and the domination-based MO-GOMEA. In doing so, we investigate in which scenarios either domination-based or hypervolume-based methods are preferred. Finally, we construct a simple hybrid approach that combines MO-GOMEA with UHV-GOMEA and outperforms both.



中文翻译:

基于非拥挤超体积的多目标优化与基因池最优混合

基于支配的多目标 (MO) 进化算法 (EA) 可以说是当今最常用的 MOEA 类型。然而,当大多数人口变得非支配时,这些方法就会停滞不前,从而阻止进一步收敛到帕累托集。基于超体积的 MO 优化已经显示出有希望的结果来克服这个问题。然而,直接使用超体积不会导致对主导解决方案的选择压力。最近推出的 Sofomore 框架通过解决多个交错的单目标动态问题来克服这个问题,这些问题基于非拥挤超体积改进 (UHVI) 迭代地改进单个近似集。然而,它因此失去了基于群体的 MO 优化的许多优点,例如处理多模态。在这里,我们将 UHVI 重新表述为近似集的质量度量,称为非拥挤超体积(UHV),可用于使用单目标优化器直接解决 MO 优化问题。我们使用最先进的基因库优化混合进化算法 (GOMEA),该算法能够有效地利用该问题固有的可用灰盒特性。将得到的算法 UHV-GOMEA 与配备 GOMEA 的 Sofomore 和基于支配的 MO-GOMEA 进行比较。在这样做的过程中,我们研究了在哪些场景中首选基于支配或基于超容量的方法。最后,我们构建了一种简单的混合方法,将 MO-GOMEA 与 UHV-GOMEA 相结合,并优于两者。我们使用最先进的基因库优化混合进化算法 (GOMEA),该算法能够有效地利用该问题固有的可用灰盒特性。将得到的算法 UHV-GOMEA 与配备 GOMEA 的 Sofomore 和基于支配的 MO-GOMEA 进行比较。在这样做的过程中,我们研究了在哪些场景中首选基于支配或基于超容量的方法。最后,我们构建了一种简单的混合方法,将 MO-GOMEA 与 UHV-GOMEA 相结合,并优于两者。我们使用最先进的基因库优化混合进化算法 (GOMEA),该算法能够有效地利用该问题固有的可用灰盒特性。将得到的算法 UHV-GOMEA 与配备 GOMEA 的 Sofomore 和基于支配的 MO-GOMEA 进行比较。在这样做的过程中,我们研究了在哪些场景中首选基于支配或基于超容量的方法。最后,我们构建了一种简单的混合方法,将 MO-GOMEA 与 UHV-GOMEA 相结合,并优于两者。我们研究了在哪些场景中首选基于统治或基于超容量的方法。最后,我们构建了一种简单的混合方法,将 MO-GOMEA 与 UHV-GOMEA 相结合,并优于两者。我们研究了在哪些场景中首选基于统治或基于超容量的方法。最后,我们构建了一种简单的混合方法,将 MO-GOMEA 与 UHV-GOMEA 相结合,并优于两者。

更新日期:2022-09-02
down
wechat
bug