双目标多模态优化中光滑可导航近似集的获取
Obtaining Smoothly Navigable Approximation Sets in Bi-Objective Multi-Modal Optimization
摘要:
即使多模态多目标进化算法(MMOEA)被设计为找到在多模态多目标优化问题(MMOP)的所有局部最优近似集上分布良好的解,也存在所找到的解集不能平滑导航的风险,因为解属于各种小生境,从而降低了决策者的洞察力。为了解决这个问题,提出了一种新的MMOEA:多模态贝塞尔进化算法(MM-BezEA),它产生的近似集,覆盖各个小生境,并表现出固有的决策空间平滑,因为它们是参数化的贝塞尔曲线。MM-BezEA结合了最近引入的BezEA和MO-HillVallEA背后的概念,以找到所有局部最优近似集。当在具有线性帕累托集的MMOP上对MMOEA MO_Ring_PSO_SCD和MO-HillVallEA进行基准测试时,发现MM-BezEA在最佳超体积方面表现最佳。
英文摘要:
Even if a Multi-modal Multi-Objective Evolutionary Algorithm (MMOEA) is designed to find solutions well spread over all locally optimal approximation sets of a Multi-modal Multi-objective Optimization Problem (MMOP), there is a risk that the found set of solutions is not smoothly navigable because the solutions belong to various niches, reducing the insight for decision makers. To tackle this issue, a new MMOEAs is proposed: the Multi-Modal Bézier Evolutionary Algorithm (MM-BezEA), which produces approximation sets that cover individual niches and exhibit inherent decision-space smoothness as they are parameterized by Bézier curves. MM-BezEA combines the concepts behind the recently introduced BezEA and MO-HillVallEA to find all locally optimal approximation sets. When benchmarked against the MMOEAs MO_Ring_PSO_SCD and MO-HillVallEA on MMOPs with linear Pareto sets, MM-BezEA was found to perform best in terms of best hypervolume.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。