arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1912.08112math.OCcs.LG
收藏

一种基于学习的快速计算随机规划优良原始解的算法

A learning-based algorithm to quickly compute good primal solutions for Stochastic Integer Programs

University of Montreal(蒙特利尔大学);Mila - Quebec Artificial Intelligence Institute(Mila-魁北克人工智能研究所);Polytechnique Montreal(蒙特利尔高等理工学院)

Yoshua Bengio, Emma Frejinger, Andrea Lodi, Rahul Patel, Sriram Sankaranarayanan

摘要:

提出了一种新的方法,使用监督学习获得两阶段随机整数规划(2SIP)的第一和第二阶段的约束条件下的近优原始解。该算法的目标是预测一个“代表性的场景”(RS)的问题,这样,确定性地解决2SIP与随机实现等于RS,给出了一个接近最优解的原始2SIP。预测RS,而不是直接预测解决方案,确保解决方案的第一阶段可行性。如果已知问题具有完全追索权,则第二阶段的可行性也得到保证。对于计算测试,我们学习找到一个RS的两阶段随机设施定位问题的整数变量和线性约束在这两个阶段,并始终提供近最优解。我们的计算时间是非常有竞争力的通用整数规划求解器,以实现类似的解决方案的质量。

英文摘要:

We propose a novel approach using supervised learning to obtain near-optimal primal solutions for two-stage stochastic integer programming (2SIP) problems with constraints in the first and second stages. The goal of the algorithm is to predict a "representative scenario" (RS) for the problem such that, deterministically solving the 2SIP with the random realization equal to the RS, gives a near-optimal solution to the original 2SIP. Predicting an RS, instead of directly predicting a solution ensures first-stage feasibility of the solution. If the problem is known to have complete recourse, second-stage feasibility is also guaranteed. For computational testing, we learn to find an RS for a two-stage stochastic facility location problem with integer variables and linear constraints in both stages and consistently provide near-optimal solutions. Our computing times are very competitive with those of general-purpose integer programming solvers to achieve a similar solution quality.

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

↑