0-1最小背包问题的分治策略分析
Analysis of Divide & Conquer strategies for the 0-1 Minimization Knapsack Problem
摘要:
我们介绍和评估几个分而治之的启发式策略,旨在解决大的0-1最小化背包问题的情况。该方法将一个大问题细分为两个较小的问题(或相同原理的递归迭代),以降低原始问题的全局计算复杂性,代价是解的质量有适度的损失。理论的数学结果,以保证算法的成功应用的方法,并建议其实施的潜在战略。相比之下,由于缺乏理论结果,解决方案的质量恶化的经验测量的Monte Carlo模拟的几种类型和值的选择策略。最后,引入效率的参数,我们建议最佳的策略,这取决于数据输入。
英文摘要:
We introduce and asses several Divide \& Conquer heuristic strategies aimed to solve large instances of the 0-1 Minimization Knapsack Problem. The method subdivides a large problem in two smaller ones (or recursive iterations of the same principle), to lower down the global computational complexity of the original problem, at the expense of a moderate loss of quality in the solution. Theoretical mathematical results are presented in order to guarantee an algorithmically successful application of the method and to suggest the potential strategies for its implementation. In contrast, due to the lack of theoretical results, the solution's quality deterioration is measured empirically by means of Monte Carlo simulations for several types and values of the chosen strategies. Finally, introducing parameters of efficiency we suggest the best strategies depending on the data input.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。