arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2507.09503eess.SYcs.LGcs.SY
收藏

神经两阶段随机优化用于解决单位调度问题

Neural Two-Stage Stochastic Optimization for Solving Unit Commitment Problem

Department of Electrical and Computer Engineering, University of California, Riverside(加州大学河滨分校电气与计算机工程系)

Zhentong Shao, Jingtao Qin, Nanpeng Yu

AI总结:

本文提出一种神经随机优化方法,高效解决高维不确定性下的两阶段随机单位调度问题,通过深度神经网络近似第二阶段恢复问题,实现运算约束的显式约束和不确定性特征的保留。

摘要:

本文提出了一种神经随机优化方法,用于高效解决高维不确定性下的两阶段随机单位调度(2S-SUC)问题。所提出的方法利用深度神经网络近似第二阶段恢复问题,该网络通过映射调度决策和不确定性特征到恢复成本来训练。训练后的网络随后被嵌入到第一阶段UC问题中作为混合整数线性规划(MILP),从而在保持关键不确定性特征的同时显式执行运营约束。采用场景嵌入网络以实现任意场景集中的降维和特征聚合,作为数据驱动的场景缩减机制。在IEEE 5节点、30节点和118节点系统上的数值实验表明,所提出的神经两阶段随机优化方法在最优性间隙小于1%的情况下,相比传统MILP求解器和分解方法实现了数量级的加速。此外,模型的大小在场景数量变化时保持不变,为大规模随机单位调度问题提供了显著的可扩展性。

英文摘要:

This paper proposes a neural stochastic optimization method for efficiently solving the two-stage stochastic unit commitment (2S-SUC) problem under high-dimensional uncertainty scenarios. The proposed method approximates the second-stage recourse problem using a deep neural network trained to map commitment decisions and uncertainty features to recourse costs. The trained network is subsequently embedded into the first-stage UC problem as a mixed-integer linear program (MILP), allowing for explicit enforcement of operational constraints while preserving the key uncertainty characteristics. A scenario-embedding network is employed to enable dimensionality reduction and feature aggregation across arbitrary scenario sets, serving as a data-driven scenario reduction mechanism. Numerical experiments on IEEE 5-bus, 30-bus, and 118-bus systems demonstrate that the proposed neural two-stage stochastic optimization method achieves solutions with an optimality gap of less than 1%, while enabling orders-of-magnitude speedup compared to conventional MILP solvers and decomposition-based methods. Moreover, the model's size remains constant regardless of the number of scenarios, offering significant scalability for large-scale stochastic unit commitment problems.

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

↑