Search NASA⌕ Search

SEARCH · Search NASA

Results for “surrogate absolute-value lagrangian relaxation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

A scalable planning framework of energy storage systems under frequency dynamics constraints

As the penetration of renewables increases in power systems, the declining system inertia can cause frequency stability issues. Battery energy storage systems (BESSs) respond fast and therefore can relieve the low inertia difficulty but need to be appropriately sized considering the associated cost. This paper presents a novel stochastic optimization model for economically planning BESS capacity while considering the spatial–temporal correlation of wind generation and generator outages under frequency stability constraints, which include the rate-of-change of frequency (RoCoF), frequency nadir (FN), and quasi-steady-state (QSS) frequency. A set of new FN constraints that can be easily linearized is developed. To account for renewable uncertainties, a realistic uncertainty modeling approach, Random Field, is adopted to generate wind generation scenarios by considering both spatial and temporal evolutions of wind speed profiles. The ESS sizing is formulated as a mixed-integer linear programming problem and solved by using a scalable decomposition-and-coordination approach, Surrogate Absolute Value Lagrangian Relaxation (SAVLR). To further improve the scalability and reduce computational burdens, a rolling-horizon-based update is developed and incorporated into SAVLR for providing a practical solution to the long-term planning of very large-scale power systems. Finally, a modified IEEE 118-bus system and the Polish system are used to validate the effectiveness and scalability of the model and solution methodology.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Decomposition-Based Learn-To-Optimize Approach with Feasibility Layer Assistance for Sub-Hourly Unit Commitment

Sub-hourly unit commitment (UC) with 15-min intervals is gaining significant attention as a way to respond rapidly to the fluctuations in electricity supply and demand introduced by renewable resources. However, the increased temporal resolution and complex inter-temporal dependencies pose substantial computational challenges for traditional optimization methods. To this end, this paper explores a decomposition-based learn-to-optimize approach. Building on recent advances in machine learning, our method revisits the long- overlooked Lagrangian relaxation framework, which is a classical decomposition technique that enables tractable subproblem solving. These smaller subproblems are inherently well-suited for machine learning, as their reduced dimensionality and structural regularity allow predictive models to efficiently learn and generalize solution patterns. We thus propose a generic predictive model, which embeds Gated Recurrent Units (GRUs) and Attention in the encoder-decoder structure, and integrate a rule-based feasibility layer to capture temporal dependencies, reduce training effort, and improve feasibility w.r.t. unit-level constraints. Our method has been validated on the IEEE 118-bus system, demonstrating promising performance in solving sub-hourly UC problems efficiently and feasibly.

97 MATHEMATICS AND COMPUTING↗