arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2107.00866cs.AIcs.LGmath.OC
收藏

混合可编程程序的原始启发式学习

Learning Primal Heuristics for Mixed Integer Programs

RMIT University(皇家墨尔本理工大学);Monash University(莫纳什大学)

Yunzhuang Shen, Yuan Sun, Andrew Eberhard, Xiaodong Li

摘要:

提出了一种基于机器学习技术的混合规划原始启发式算法。混合规划是求解组合优化问题的一种通用方法。在求解器内部,原始算法在寻找良好的可行解方面发挥着至关重要的作用,使人们能够从分支定界算法(B&B)的一开始就缩小二元差距,通过积极修剪B&B树来大大提高其性能。在本文中,我们调查是否有效的原始算法可以通过机器学习自动学习。我们提出了一种新的方法来表示的优化问题作为一个图形,并训练一个图卷积网络解决问题的实例与已知的最佳解决方案。这反过来又可以预测类似类型的未知问题实例的最佳解决方案中决策变量的值。然后,利用一种新的配置的B&B方法,概率分支与引导深度优先搜索(PB-DFS)的方法,旨在快速找到(近)最优的解决方案的预测变量的解决方案。实验结果表明,这种新的启发式可以找到更好的原始解决方案在更早的阶段的求解过程中,相比其他国家的最先进的原始启发式。

英文摘要:

This paper proposes a novel primal heuristic for Mixed Integer Programs, by employing machine learning techniques. Mixed Integer Programming is a general technique for formulating combinatorial optimization problems. Inside a solver, primal heuristics play a critical role in finding good feasible solutions that enable one to tighten the duality gap from the outset of the Branch-and-Bound algorithm (B&B), greatly improving its performance by pruning the B&B tree aggressively. In this paper, we investigate whether effective primal heuristics can be automatically learned via machine learning. We propose a new method to represent an optimization problem as a graph, and train a Graph Convolutional Network on solved problem instances with known optimal solutions. This in turn can predict the values of decision variables in the optimal solution for an unseen problem instance of a similar type. The prediction of variable solutions is then leveraged by a novel configuration of the B&B method, Probabilistic Branching with guided Depth-first Search (PB-DFS) approach, aiming to find (near-)optimal solutions quickly. The experimental results show that this new heuristic can find better primal solutions at a much earlier stage of the solving process, compared to other state-of-the-art primal heuristics.

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

↑