面向具有 SOS1 约束的 MIP 的单样本学习
One-shot Learning for MIPs with SOS1 Constraints
AI总结:
针对含 SOS1 约束的 MIP,本文提出利用分支定界树中已有解构建模型的低开销单样本学习启发式算法,并在 LAP 和 MIPLIB 实例上验证其可有效降低平均原始间隙。
摘要:
组织需要高效的算法和求解器来快速给出最优或近优解,从而对供应链中断或客户需求变化等动态情况迅速作出反应。当前最先进的混合整数规划(MIP)求解器旨在处理种类广泛的问题,但许多现实场景中的问题实例来自一个狭窄的分布。这促使人们开发定制化方法,利用历史数据来指导启发式算法设计。深度学习(DL)方法通常用于在此情境下从数据中提取模式,但它们需要大型数据集和全面的超参数调优才能取得优异性能。本文介绍一种单样本学习启发式算法,该算法利用在分支定界树内发现的解来构建模型,且额外开销极小。我们在机车分配问题(LAP)以及多组包含基于第一类特殊有序集约束的 MIPLIB 实例上评估了该方法。实验结果包括与多种原始启发式算法和最先进 MIP 求解器的比较。结果表明,就平均原始间隙而言,该方法与 CPLEX 配合使用时最为有效。
英文摘要:
Efficient algorithms and solvers are required to provide optimal or near-optimal solutions quickly and enable organizations to react promptly to dynamic situations such as supply chain disruptions or changing customer demands. State-of-the-art mixed-integer programming (MIP) solvers are crafted to tackle a wide variety of problems, yet many real-world situations are characterized by problem instances that originate from a narrow distribution. This has inspired the creation of tailored approaches that exploit historical data to inform heuristic design. Deep learning (DL) methods are typically used in this context to extract patterns from data, but they require large datasets and comprehensive hyperparameter tuning for strong performance. This article describes a one-shot learning heuristic that leverages solutions discovered within the branch-and-bound tree to construct a model with minimal overhead. We evaluate our method on the locomotive assignment problem (LAP) and sets of MIPLIB instances that contain constraints based on special ordered sets of type 1. Experimental results include a comparison with multiple primal heuristics and state-of-the-art MIP solvers. We show that the method is most effective with CPLEX in terms of the average primal gap.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。