arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.13842math.OCcs.DM
收藏

多目标组合优化中的支持性研究

On Supportedness in Multi-Objective Combinatorial Optimization

David Könen, Michael Stiglmayr

AI总结:

针对多目标组合优化问题中受支持非支配点定义不一致的问题,本文通过实例证明不同定义在该类问题中不等价,分析了对应集合的结构与计算性质,梳理了等价定义并提出受支持与弱受支持有效解的区分。

摘要:

本文探讨了多目标组合优化问题(MOCO)中受支持非支配点的各类定义存在的不一致性问题。已知MOCO问题包含受支持与不受支持的非支配点,通常后者数量多于前者。一般而言,受支持点更易确定,可作为代表性点,还可在两阶段方法中用于生成完整的非支配点集。尽管其重要性显著,文献中针对受支持有效解(及受支持非支配点)存在多种不同的刻画方式。\n虽然这些定义在多目标线性问题中是等价的,但在MOCO问题中可能得到不同的受支持非支配点集合。我们通过实例证明,这些定义在MOCO或一般多目标优化问题中并不等价。此外,我们分析了由此得到的各类受支持非支配点集合的结构与计算性质。基于这些考量,我们梳理了受支持有效解的等价定义与刻画方式,并提出了受支持有效解与弱受支持有效解的区分。

英文摘要:

This paper addresses an inconsistency in various definitions of supported non-dominated points within multi-objective combinatorial problems (MOCO). MOCO problems are known to contain supported and unsupported non-dominated points, with the latter typically outnumbering the former. Supported points are, in general, easier to determine, can serve as representations, and are used in two-phase methods to generate the entire non-dominated point set. Despite their importance, several different characterizations for supported efficient solutions (and supported non-dominated points) are used in the literature. While these definitions are equivalent for multi-objective linear problems, they can yield different sets of supported non-dominated points for MOCO problems. We show by an example that these definitions are not equivalent for MOCO or general multi-objective optimization problems. Moreover, we analyze the structural and computational properties of the resulting sets of supported non-dominated points. These considerations motivate us to summarize equivalent definitions and characterizations for supported efficient solutions and to introduce a distinction between supported and weakly supported efficient solutions.

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

↑