arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.02170cs.NE
收藏

约束连续多目标优化问题的特征化:性能空间的观点

Characterization of Constrained Continuous Multiobjective Optimization Problems: A Performance Space Perspective

Aljoša Vodopija, Tea Tušar, Bogdan Filipič

摘要:

约束多目标优化问题在过去几年中得到了广泛的关注。然而,约束多目标优化问题(CMOPs)仍然没有得到令人满意的理解。因此,难以选择适当的CMOPs作为基准,而且缺乏正式背景。本文通过从性能空间的角度探索CMOPs来解决这个问题。首先,它提出了一种新的性能评估方法显式设计的约束多目标优化。这种方法提供了第一次尝试,同时测量近似帕累托前沿和约束满足的性能。其次,它提出了一种方法来衡量给定的优化问题的能力,以区分算法的性能。最后,这种方法是用来对比八个常用的人工测试集的CMOPs。实验结果表明,该套件是更有效的区分三个著名的多目标优化算法。基准设计人员可以使用这些结果来选择最适合他们需求的CMOP。

英文摘要:

Constrained multiobjective optimization has gained much interest in the past few years. However, constrained multiobjective optimization problems (CMOPs) are still unsatisfactorily understood. Consequently, the choice of adequate CMOPs for benchmarking is difficult and lacks a formal background. This paper addresses this issue by exploring CMOPs from a performance space perspective. First, it presents a novel performance assessment approach designed explicitly for constrained multiobjective optimization. This methodology offers a first attempt to simultaneously measure the performance in approximating the Pareto front and constraint satisfaction. Secondly, it proposes an approach to measure the capability of the given optimization problem to differentiate among algorithm performances. Finally, this approach is used to contrast eight frequently used artificial test suites of CMOPs. The experimental results reveal which suites are more efficient in discerning between three well-known multiobjective optimization algorithms. Benchmark designers can use these results to select the most appropriate CMOPs for their needs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑