Variable-metric method and parallel processing for Contingency-Constrained Power Flow Optimization
An algorithm for two related problems that the electrical power dispatcher would like to solve in realtime is presented. The first problem is the Dispatcher Optimal Power Flow (DOPF), which seeks to minimize network operation cost while satisfying constraints related to network configuration and load, frequency and interchange requirements. The second problem is the Contingency-Constrained Optimal Power Flow (CCOPF) which adds constraints to the DOPF which address security issues resulting from the occurrence of random disturbances/outages. This thesis extends the Han-Powell algorithm. A method for solving the DOPF and CCOPF problems with parallel processors is presented. Parallel decomposition results using the method to solve k-parallel constraint sets and an optimal power flow are described as implemented on the VAX-11/780. The implementation simulates distributed processing for a small power system (30 buses) and for a medium power system (555 buses). Six contingencies are handled for the small system and two for the medium system.
- Research Organization:
- Carnegie-Mellon Univ., Pittsburgh, PA (USA)
- OSTI ID:
- 6280281
- Country of Publication:
- United States
- Language:
- English
Similar Records
A multi-agent technique for contingency constrained optimal power flows