Natural Gas Short-Term Operation Problem with Dynamics: A Rank Minimization Approach
Reza Bayani, Saeed D. Manshadi

TL;DR
This paper introduces a rank minimization approach to accurately model natural gas network dynamics in short-term operation problems, outperforming traditional simplified equations in solution quality and computational efficiency.
Contribution
It proposes a convex relaxation scheme using rank minimization for non-linear gas flow equations, improving solution accuracy and efficiency in dynamic natural gas network optimization.
Findings
The proposed model captures gas demand fluctuations through pipeline pressure adjustments.
The method improves solution optimality compared to traditional Weymouth equation-based models.
Scalability is verified in a case study demonstrating computational efficiency.
Abstract
Natural gas-fired generation units can hedge against the volatility in the uncertain renewable generation, which may occur during very short periods. It is crucial to utilize models capable of correctly capturing the natural gas network dynamics induced by the volatile demand of gas-fired units. The Weymouth equation is commonly implemented in literature to avoid dealing with the mathematical complications of solving the original governing differential equations of the natural gas dynamics. However, it is shown in this paper that this approach is not reliable in the short-term operation problem. Here, the merit of the non-convex transient model is compared with the simplified Weymouth equation, and the drawbacks of employing the Weymouth equation are illustrated. The results demonstrate how changes in the natural gas demand are met by adjustment in the pressure within pipelines rather…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
