






























Abstract: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.
| Comments: | The experimental results may require further refinement, and changes in the first author's affiliation may have affected the presentation of the work |
| Subjects: | Systems and Control (eess.SY); Machine Learning (cs.LG) |
| Cite as: | arXiv:2507.09503 [eess.SY] |
| (or arXiv:2507.09503v4 [eess.SY] for this version) | |
| https://doi.org/10.48550/arXiv.2507.09503 arXiv-issued DOI via DataCite |
From: Zhentong Shao [view email]
[v1]
Sun, 13 Jul 2025 05:55:25 UTC (173 KB)
[v2]
Wed, 8 Apr 2026 07:24:00 UTC (1 KB) (withdrawn)
[v3]
Thu, 9 Apr 2026 17:43:27 UTC (1 KB) (withdrawn)
[v4]
Tue, 14 Apr 2026 22:40:03 UTC (170 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。