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

求解析取约束背包问题的一种基于阈值搜索的模因算法

A threshold search based memetic algorithm for the disjunctively constrained knapsack problem

Zequn Wei, Jin-Kao Hao

摘要:

析取约束背包问题是将一组两两相容的物品装入一个容量受限的背包中,使得所选物品的总利润最大化,同时满足背包容量。DCKP有许多应用,但在计算上具有挑战性(NP难)。在这项工作中,我们提出了一个基于阈值搜索的模因算法解决DCKP,结合模因框架与阈值搜索,以找到高质量的解决方案。在文献中的两组6340个基准实例的广泛的计算评估表明,该算法是非常有竞争力的国家的最先进的方法相比。特别是,我们报告24和354个改进的最知名的结果(新的下限),为集I(100例)和集II(6240例),分别。我们分析了关键的算法组件,并阐明了它们对算法性能的作用。我们算法的代码将公开提供。

英文摘要:

The disjunctively constrained knapsack problem consists in packing a subset of pairwisely compatible items in a capacity-constrained knapsack such that the total profit of the selected items is maximized while satisfying the knapsack capacity. DCKP has numerous applications and is however computationally challenging (NP-hard). In this work, we present a threshold search based memetic algorithm for solving the DCKP that combines the memetic framework with threshold search to find high quality solutions. Extensive computational assessments on two sets of 6340 benchmark instances in the literature demonstrate that the proposed algorithm is highly competitive compared to the state-of-the-art methods. In particular, we report 24 and 354 improved best-known results (new lower bounds) for Set I (100 instances) and for Set II (6240 instances), respectively. We analyze the key algorithmic components and shed lights on their roles for the performance of the algorithm. The code of our algorithm will be made publicly available.

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

↑