arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2208.10028math.OC
收藏

利用实例和变量相似性改进学习增强分支算法

Exploiting Instance and Variable Similarity to Improve Learning-Enhanced Branching

Xiaoyi Gu, Santanu S. Dey, Álinson S. Xavier, Feng Qiu

摘要:

在许多操作应用中,必须在非常有限的时间窗口内常规地找到具有挑战性的混合整数线性规划(MILP)问题的可证明的好的解决方案。一个例子是安全约束机组组合(SCUC)问题,每天解决,以清除日前的电力市场。以前的研究表明,机器学习(ML)方法可以为组合问题产生高质量的启发式解决方案,但即使使用最近提出的学习增强分支方法,证明这些解决方案的最优性仍然很耗时。在本文中,我们提出了一个简单的修改,以提高性能的学习增强分支方法的基础上的关键观察,在这样的操作应用程序中,实例显着相似。具体而言,实例通常共享相同的大小和问题结构,仅在矩阵系数、右侧和目标函数上略有不同。此外,给定实例中的某些变量组通常也彼此相似。因此,与文献中以前使用单个ML模型预测所有分支分数的工作不同,我们建议根据它们的相似性,为每个变量或每组变量训练单独的ML模型。我们评估这种增强现实的大规模SCUC实例,我们获得了显着更好的差距关闭比以前的作品具有相同数量的训练数据。

英文摘要:

In many operational applications, it is necessary to routinely find, within a very limited time window, provably good solutions to challenging mixed-integer linear programming (MILP) problems. An example is the Security-Constrained Unit Commitment (SCUC) problem, solved daily to clear the day-ahead electricity markets. Previous research demonstrated that machine learning (ML) methods can produce high-quality heuristic solutions to combinatorial problems, but proving the optimality of these solutions, even with recently-proposed learning-enhanced branching methods, can still be time-consuming. In this paper, we propose a simple modification to improve the performance of learning-enhanced branching methods based on the key observation that, in such operational applications, instances are significantly similar to each other. Specifically, instances typically share the same size and problem structure, with slight differences only on matrix coefficients, right-hand sides and objective function. In addition, certain groups of variables within a given instance are also typically similar to each other. Therefore, unlike previous works in the literature which predicted all branching scores with a single ML model, we propose training separate ML models per variable or per groups of variables, based on their similarity. We evaluate this enhancement on realistic large-scale SCUC instances and we obtain significantly better gap closures than previous works with the same amount of training data.

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

↑