稳健性(进化)
数学优化
多目标优化
计算机科学
测试套件
帕累托原理
健身景观
帕累托最优
最优化问题
适应度近似
利基
适应性策略
进化策略
CMA-ES公司
进化算法
进化计算
人工智能
选择(遗传算法)
一套
机器学习
适应(眼睛)
适应度函数
可靠性(半导体)
粒子群优化
遗传算法
数学
作者
Ali Ahrari,Ruhul Sarker,Mike Preuß
标识
DOI:10.1109/tevc.2025.3609902
摘要
Unlike multiobjective optimization (MOO), multimodal multiobjective optimization (MMMOO) should approximate the entire Pareto set, even if a portion of it maps onto the entire Pareto front. This study introduces a novel evolution strategy with adaptive fitness sharing (AFS) for MMMOO. The method, called, AFS-MMMO-ES, calculates an overall fitness for each solution in the selection pool based on its rank-wise hypervolume contribution, Pareto rank, and niche count in the decision space. Since the optimal niche radius is problem-dependent, this study introduces a novel strategy for on-the-fly adaptation of the niche radius. Simulations on meticulously designed test problems are performed to confirm the efficacy and reliability of this strategy in learning the optimal niche radius, as well as its significant impact on enhancing robustness and performance. Furthermore, AFS-MMMO-ES can easily reflect the relative importance of decision space diversity based on the decision-maker’s preference, a practically important feature that has been overlooked in this research field. Finally, the performance of AFS-MMMO-ES is assessed and compared with several successful MMMOO methods on a widely accepted test suite for MMMOO. Comparisons of numerical results reveal the robustness and superiority of AFS-MMMO-ES over its competitors.
科研通智能强力驱动
Strongly Powered by AbleSci AI