arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.09665cs.DScs.AI
收藏

基于包含极大解的0-1背包问题的特征

Features for the 0-1 knapsack problem based on inclusionwise maximal solutions

KU Leuven(鲁汶大学);Flanders Make(法兰德斯制造研究院);University of Antwerp(安特卫普大学)

Jorik Jooken, Pieter Leyman, Patrick De Causmaecker

摘要:

几十年来对0-1背包问题的研究导致了非常有效的算法,能够快速解决大型问题实例的最优性。这促使研究人员也调查是否存在相对较小的问题实例,这些问题对于现有的解决者来说很难,并调查哪些特征表征了它们的难度。在此之前,作者提出了一类新的硬0-1背包问题实例,并证明了所谓的包含最大解(IMS)的属性可以是这类问题的重要硬度指标。在当前的文件中,我们制定了几个新的计算挑战性的问题,与任意0-1背包问题实例的IMS。在前人工作的基础上,结合IMSs的新结构,提出了多项式和伪多项式时间算法。由此,我们得到了一组14个计算昂贵的功能,我们计算了两个大型数据集的超级计算机在大约540 CPU小时。我们表明,所提出的功能包含重要的信息相关的经验硬度的问题实例,这是失踪的早期功能从文献中训练机器学习模型,可以准确地预测各种各样的0-1背包问题实例的经验硬度。使用实例空间分析方法,我们还表明,硬0-1背包问题的实例聚集在一起,围绕一个相对密集的区域的实例空间和几个功能表现不同的实例空间的容易和困难的部分。

英文摘要:

Decades of research on the 0-1 knapsack problem led to very efficient algorithms that are able to quickly solve large problem instances to optimality. This prompted researchers to also investigate whether relatively small problem instances exist that are hard for existing solvers and investigate which features characterize their hardness. Previously the authors proposed a new class of hard 0-1 knapsack problem instances and demonstrated that the properties of so-called inclusionwise maximal solutions (IMSs) can be important hardness indicators for this class. In the current paper, we formulate several new computationally challenging problems related to the IMSs of arbitrary 0-1 knapsack problem instances. Based on generalizations of previous work and new structural results about IMSs, we formulate polynomial and pseudopolynomial time algorithms for solving these problems. From this we derive a set of 14 computationally expensive features, which we calculate for two large datasets on a supercomputer in approximately 540 CPU-hours. We show that the proposed features contain important information related to the empirical hardness of a problem instance that was missing in earlier features from the literature by training machine learning models that can accurately predict the empirical hardness of a wide variety of 0-1 knapsack problem instances. Using the instance space analysis methodology, we also show that hard 0-1 knapsack problem instances are clustered together around a relatively dense region of the instance space and several features behave differently in the easy and hard parts of the instance space.

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

↑