• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

如何在超体积计算中指定参考点以实现公平的性能比较。

How to Specify a Reference Point in Hypervolume Calculation for Fair Performance Comparison.

机构信息

Shenzhen Key Laboratory of Computational Intelligence, Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen, 518005, China

Department of Computer Science and Intelligent Systems, Osaka Prefecture University, Sakai, 5998531, Japan

出版信息

Evol Comput. 2018 Fall;26(3):411-440. doi: 10.1162/evco_a_00226. Epub 2018 May 22.

DOI:10.1162/evco_a_00226
PMID:29786458
Abstract

The hypervolume indicator has frequently been used for comparing evolutionary multi-objective optimization (EMO) algorithms. A reference point is needed for hypervolume calculation. However, its specification has not been discussed in detail from a viewpoint of fair performance comparison. A slightly worse point than the nadir point is usually used for hypervolume calculation in the EMO community. In this paper, we propose a reference point specification method for fair performance comparison of EMO algorithms. First, we discuss the relation between the reference point specification and the optimal distribution of solutions for hypervolume maximization. It is demonstrated that the optimal distribution of solutions strongly depends on the location of the reference point when a multi-objective problem has an inverted triangular Pareto front. Next, we propose a reference point specification method based on theoretical discussions on the optimal distribution of solutions. The basic idea is to specify the reference point so that a set of well-distributed solutions over the entire linear Pareto front has a large hypervolume and all solutions in such a solution set have similar hypervolume contributions. Then, we examine whether the proposed method can appropriately specify the reference point through computational experiments on various test problems. Finally, we examine the usefulness of the proposed method in a hypervolume-based EMO algorithm. Our discussions and experimental results clearly show that a slightly worse point than the nadir point is not always appropriate for performance comparison of EMO algorithms.

摘要

超体积指标常用于比较进化多目标优化(EMO)算法。超体积计算需要参考点。然而,从公平性能比较的角度来看,其规范尚未详细讨论。在 EMO 社区中,通常使用比最劣点略差的点进行超体积计算。在本文中,我们提出了一种 EMO 算法公平性能比较的参考点规范方法。首先,我们讨论了参考点规范与超体积最大化的解最优分布之间的关系。当多目标问题具有倒三角型 Pareto 前沿时,证明了解的最优分布强烈依赖于参考点的位置。接下来,我们提出了一种基于对解最优分布的理论讨论的参考点规范方法。基本思想是指定参考点,以便在整个线性 Pareto 前沿上具有较大超体积的一组分布良好的解,并且此类解集内的所有解具有相似的超体积贡献。然后,我们通过对各种测试问题的计算实验来检查所提出的方法是否可以适当地指定参考点。最后,我们在基于超体积的 EMO 算法中检查了所提出方法的有用性。我们的讨论和实验结果清楚地表明,在 EMO 算法的性能比较中,比最劣点略差的点并不总是合适的。

相似文献

1
How to Specify a Reference Point in Hypervolume Calculation for Fair Performance Comparison.如何在超体积计算中指定参考点以实现公平的性能比较。
Evol Comput. 2018 Fall;26(3):411-440. doi: 10.1162/evco_a_00226. Epub 2018 May 22.
2
Multiplicative approximations, optimal hypervolume distributions, and the choice of the reference point.乘法近似、最优超体积分布及参考点的选择
Evol Comput. 2015 Spring;23(1):131-59. doi: 10.1162/EVCO_a_00126. Epub 2014 Sep 26.
3
HypE: an algorithm for fast hypervolume-based many-objective optimization.HypE:一种基于快速超体积的多目标优化算法。
Evol Comput. 2011 Spring;19(1):45-76. doi: 10.1162/EVCO_a_00009. Epub 2010 Jul 22.
4
An efficient algorithm for computing hypervolume contributions.一种计算超体积贡献的有效算法。
Evol Comput. 2010 Fall;18(3):383-402. doi: 10.1162/EVCO_a_00012.
5
A new evolutionary algorithm for solving many-objective optimization problems.一种用于解决多目标优化问题的新型进化算法。
IEEE Trans Syst Man Cybern B Cybern. 2008 Oct;38(5):1402-12. doi: 10.1109/TSMCB.2008.926329.
6
The Set-Based Hypervolume Newton Method for Bi-Objective Optimization.用于双目标优化的基于集合的超体积牛顿法
IEEE Trans Cybern. 2020 May;50(5):2186-2196. doi: 10.1109/TCYB.2018.2885974. Epub 2018 Dec 25.
7
Global WASF-GA: An Evolutionary Algorithm in Multiobjective Optimization to Approximate the Whole Pareto Optimal Front.全局WASF-GA:一种用于逼近整个帕累托最优前沿的多目标优化进化算法。
Evol Comput. 2017 Summer;25(2):309-349. doi: 10.1162/EVCO_a_00175. Epub 2016 Feb 8.
8
Uncrowded Hypervolume-Based Multiobjective Optimization with Gene-Pool Optimal Mixing.基于非拥挤超体积的多目标优化与基因池最优混合
Evol Comput. 2022 Sep 1;30(3):329-353. doi: 10.1162/evco_a_00303.
9
What Weights Work for You? Adapting Weights for Any Pareto Front Shape in Decomposition-Based Evolutionary Multiobjective Optimisation.什么权重适合你?在基于分解的进化多目标优化中适应任何帕累托前沿形状的权重。
Evol Comput. 2020 Summer;28(2):227-253. doi: 10.1162/evco_a_00269. Epub 2020 Feb 26.
10
Greedy Hypervolume Subset Selection in Low Dimensions.低维空间中的贪婪超体积子集选择
Evol Comput. 2016 Fall;24(3):521-44. doi: 10.1162/EVCO_a_00188. Epub 2016 Jun 15.

引用本文的文献

1
A fuzzy system based self-adaptive memetic algorithm using population diversity control for evolutionary multi-objective optimization.一种基于模糊系统的自适应混合算法,用于进化多目标优化的种群多样性控制。
Sci Rep. 2025 Feb 17;15(1):5735. doi: 10.1038/s41598-025-89289-2.
2
A multi-objective optimized OLSR routing protocol.一种多目标优化的 OLSR 路由协议。
PLoS One. 2024 Apr 26;19(4):e0301842. doi: 10.1371/journal.pone.0301842. eCollection 2024.
3
A tutorial on multiobjective optimization: fundamentals and evolutionary methods.
多目标优化教程:基础与进化方法
Nat Comput. 2018;17(3):585-609. doi: 10.1007/s11047-018-9685-y. Epub 2018 May 31.