arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1911.10092cs.LGcs.AImath.OC
收藏

组合优化难题的智能预测与优化

Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems

Vrije Universiteit Brussel(布鲁塞尔自由大学);University of Melbourne(墨尔本大学)

Jaynta Mandi, Emir Demirović, Peter. J Stuckey, Tias Guns

摘要:

组合优化假设优化问题的所有参数,例如目标函数中的权重是固定的。通常,这些权重仅仅是估计值,并且越来越多地使用机器学习技术来进行估计。最近,智能预测和优化(SPO)已经提出了一个线性目标函数的预测问题,更具体地说,线性规划问题。它考虑了线性问题的预测的遗憾,通过在学习过程中反复解决它。我们研究使用SPO来解决更现实的离散优化问题。主要的挑战是重复求解优化问题。为此,我们研究了放松问题的方法,以及开始学习和解决问题的方法。我们的研究结果表明,即使是离散的问题,它往往足以训练通过解决松弛的SPO损失。此外,在大多数情况下,这种方法优于Wilder,Dilkina和Tambe的最先进方法。我们的实验加权背包问题以及复杂的调度问题,并首次表明,预测和优化方法可以成功地用于大规模的组合优化问题。

英文摘要:

Combinatorial optimization assumes that all parameters of the optimization problem, e.g. the weights in the objective function is fixed. Often, these weights are mere estimates and increasingly machine learning techniques are used to for their estimation. Recently, Smart Predict and Optimize (SPO) has been proposed for problems with a linear objective function over the predictions, more specifically linear programming problems. It takes the regret of the predictions on the linear problem into account, by repeatedly solving it during learning. We investigate the use of SPO to solve more realistic discrete optimization problems. The main challenge is the repeated solving of the optimization problem. To this end, we investigate ways to relax the problem as well as warmstarting the learning and the solving. Our results show that even for discrete problems it often suffices to train by solving the relaxation in the SPO loss. Furthermore, this approach outperforms, for most instances, the state-of-the-art approach of Wilder, Dilkina, and Tambe. We experiment with weighted knapsack problems as well as complex scheduling problems and show for the first time that a predict-and-optimize approach can successfully be used on large-scale combinatorial optimization problems.

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

↑