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

无限期随机规划的对偶动态规划

Dual dynamic programming for stochastic programs over an infinite horizon

H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology(佐治亚理工学院 H. 米尔顿·斯图尔特工业与系统工程学院)

Caleb Ju, Guanghui Lan

AI总结:

针对无限期随机规划,本文提出CE-Inf-EDDP算法,通过整合割共享等策略提升迭代复杂度,在报童及水火电规划问题中大幅缩短迭代时间并改善解质量。

摘要:

我们研究无限期随机规划的求解问题。利用问题的平稳性,我们开发了一种新颖的持续探索型无限期探索对偶动态规划(CE-Inf-EDDP)算法。CE-Inf-EDDP 基于为有限期问题设计的现有探索对偶动态规划算法,针对无限期平稳情况进行了专门调整。通过整合割共享、频繁割平面模型更新以及一种新的自适应搜索点选择策略,CE-Inf-EDDP 实现了当前最优的迭代复杂度,同时展现出令人鼓舞的数值性能。在报童问题和水火电规划问题中,CE-Inf-EDDP 相比现有方法可将每次迭代的运行时间减少最多一到两个数量级,且能保持相近的解质量,因此在相同运行时间下,最终解质量及其可保证性可得到显著提升。例如,在水火电规划问题中,CE-Inf-EDDP 相比现有方法在相对最优性间隙上实现了约一个数量级的提升。

英文摘要:

We consider solving stochastic programs over an infinite horizon. By leveraging the stationarity of the problem, we develop a novel continually-exploring infinite-horizon explorative dual dynamic programming (CE-Inf-EDDP) algorithm. CE-Inf-EDDP builds upon the existing explorative dual dynamic programming, designed for the finite-horizon problem, by specializing it for the infinite-horizon, stationary case. By incorporating cut sharing, frequent cutting-plane model updates, and a new adaptive search point selection strategy, CE-Inf-EDDP provides state-of-the-art iteration complexity while offering encouraging numerical performance. In the newsvendor and hydrothermal planning problem, CE-Inf-EDDP can reduce the runtime of each iteration by up to one to two orders of magnitude compared to prior methods while maintaining similar solution quality. As a result, the final solution quality and its guarantees can be much improved over the same runtime. For example, in the hydrothermal planning problem, CE-Inf-EDDP attains about an order of magnitude improvement in the relative optimality gap compared to existing methods.

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

↑