鲁棒可扩展装箱问题与凸背包问题的再探讨
Robust Extensible Bin Packing and Revisiting a Convex Knapsack Problem
AI总结:
针对预算不确定性下的鲁棒可扩展装箱问题,提出场景生成算法,将分离问题转化为凸背包特例并证明其NP难,开发DP与FPTAS,实验与手术案例验证高效性与实际优势。
摘要:
我们研究了具有预算不确定性的鲁棒可扩展装箱问题,在预算不确定性模型下,物品尺寸被定义为位于一个盒子与一范数球的交集内。我们为此问题提出了一种场景生成算法,该算法交替求解具有有限不确定性集合的主鲁棒装箱问题和求解分离问题。我们首先证明,在给定主问题连续松弛解的情况下,分离问题是强NP难的。然后,针对整数主问题的分离问题,我们证明该问题成为连续凸背包问题的一个特例,而已知该问题是弱NP难的。接下来,我们证明当每个函数为分段线性且仅有两段时,我们的特例仍然是NP难的。我们为我们的特例开发了一个伪多项式动态规划(DP)和一个完全多项式时间近似方案(FPTAS),其运行时间与二进制背包FPTAS的运行时间相匹配。最后,我们的计算研究表明,与使用高级混合整数(MIP)求解器求解具有特殊有序集(SOS)约束的问题相比,DP在实践中可以显著更高效。我们的实验还展示了我们的分离问题方法在求解鲁棒可扩展装箱问题中的应用,包括评估延迟主问题的精确求解,以及在中间迭代中基于近似主解进行分离。最后,一个基于真实择期手术数据的案例研究证明了我们的模型相对于实际排程和最优名义排程的潜在优势。
英文摘要:
We study a robust extensible bin packing problem, under a budget uncertainty model where item sizes lie in the intersection of a box with a one-norm ball. We design an algorithm based on the column-and-constraint generation framework, which alternates between solving a master robust bin-packing problem with a finite uncertainty set and solving a separation problem. We show that the separation is strongly NP-hard given solutions to the continuous relaxation of the master problem. Then, focusing on the separation problem for the integer master problem, we show that this problem becomes a special case of the continuous convex knapsack problem, which is known to be weakly NP-hard. Next, we prove that our special case remains NP-hard. We develop a pseudo-polynomial dynamic program (DP) and a fully polynomial-time approximation scheme (FPTAS) for our special case whose running times match those of the binary knapsack problem. Finally, our computational study shows that the DP can be significantly more efficient in practice compared with solving the problem with specially ordered set (SOS) constraints using advanced mixed-integer programming (MIP) solvers. Our experiments also demonstrate the application of our separation problem method to solving the robust extensible bin packing problem, including separating based on approximate master solutions in intermediate iterations. We further enhance the algorithm by proposing custom symmetry breaking inequalities, valid when bins have identical costs per unit of excess capacity. Finally, a case-study, based on real elective surgery data, demonstrates the potential advantage of our model compared with the actual schedule and optimal nominal schedules.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。