基于机器学习的混合规划求解方法综述
A Survey for Solving Mixed Integer Programming via Machine Learning
摘要:
本文综述了利用机器学习解决混合整数规划(MIP)问题的趋势。理论上,MIP是一个NP难问题,大多数组合优化(CO)问题都可以表示为MIP。与其他CO问题一样,MIP的人工设计启发式算法依赖于良好的初始解,并消耗大量的计算资源。因此,我们考虑应用机器学习方法来解决MIP,因为ML增强的方法可以提供基于历史数据中的典型模式的解决方案。本文首先介绍了MIP的形式和分类,以及几种传统的求解MIP的算法。在此基础上,进一步推动机器学习与MIP的不同融合,并引入相关的基于学习的方法,分为精确算法和启发式算法。最后,我们提出了基于学习的MIP求解器的前景,对MIP以外的组合优化问题的方向,也是传统的求解器和机器学习组件的相互拥抱。
英文摘要:
This paper surveys the trend of leveraging machine learning to solve mixed integer programming (MIP) problems. Theoretically, MIP is an NP-hard problem, and most of the combinatorial optimization (CO) problems can be formulated as the MIP. Like other CO problems, the human-designed heuristic algorithms for MIP rely on good initial solutions and cost a lot of computational resources. Therefore, we consider applying machine learning methods to solve MIP, since ML-enhanced approaches can provide the solution based on the typical patterns from the historical data. In this paper, we first introduce the formulation and preliminaries of MIP and several traditional algorithms to solve MIP. Then, we advocate further promoting the different integration of machine learning and MIP and introducing related learning-based methods, which can be classified into exact algorithms and heuristic algorithms. Finally, we propose the outlook for learning-based MIP solvers, direction towards more combinatorial optimization problems beyond MIP, and also the mutual embrace of traditional solvers and machine learning components.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。