Fast simultaneous feasibility testing and applications for electrical power grids
Fast simultaneous feasibility testing (SFT) for management of an electrical power grid is achieved through various innovations. The computation problem relates to evaluation of candidate solutions for external power flows into a power grid, with respect to predetermined constraints and contingencies. Storage and computations are reduced by formulating the problem in terms of transactional nodes (e.g. third party connections for generators and loads) instead of the larger number of bus nodes. Further advantages are achieved by precomputing matrices that can be reused across multiple SFT invocations, organizing matrices and operations to reduce storage and computation, and eliminating branches that have no contingency violations. The fast SFT further enables new applications for integrating SFT with a Security-Constrained Unit Commitment (SCUC) optimizer for efficient single pass solutions; operating SFT as a service to multiple SCUC solvers; or integration with Security-Constrained Economic Dispatch (SCED) optimization.
- Research Organization:
- Pacific Northwest National Laboratory (PNNL), Richland, WA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC05-76RL01830
- Assignee:
- Battelle Memorial Institute (Richland, WA)
- Patent Number(s):
- 11,418,030
- Application Number:
- 16/863,756
- OSTI ID:
- 1925007
- Country of Publication:
- United States
- Language:
- English
Sparsity-Oriented Compensation Methods for Modified Network Solutions
|
journal | May 1983 |
Security-Constrained Unit Commitment Based on a Realizable Energy Delivery Formulation
|
journal | January 2012 |
Fast Identification of Inactive Security Constraints in SCUC Problems
|
journal | November 2010 |
Partial Matrix Refactorization
|
journal | January 1986 |
Similar Records
Integrated solution techniques for security constrained unit commitment problem
FESTIV (Flexible Energy Scheduling Tool for Integrating Variable generation)