Abstract
Preventive control or remedial actions should be taken if dynamic instability for a contingency is detected. Generation rescheduling is an effective means to enhance security of power systems. A novel methodology, based on semi-infinite programming (SIP) techniques, is presented here for dynamic security- constrained generation rescheduling. Generation rescheduling is modeled as an OPF-like problem with dynamic security constraints for credible contingencies. The OPF problem is, mathematically, a SIP problem with infinite-dimensional constraints representing transient stability limits. Local reduction based on infinite norm of the violated constraints is proposed to replace the infinite constraints with finite constraints and makes the SIP problem solvable for finite standard programming method. Case study on the New England 39-bus system showed that the proposed model and approach is practical and effective.
Original language | English |
---|---|
Title of host publication | 7th IET International Conference on Advances in Power System Control, Operation and Management (APSCOM 2006) |
Edition | 523 CP |
DOIs | |
Publication status | Published - 1 Dec 2006 |
Event | 7th IET International Conference on Advances in Power System Control, Operation and Management, APSCOM 2006 - Hong Kong, Hong Kong Duration: 30 Oct 2006 → 2 Nov 2006 |
Conference
Conference | 7th IET International Conference on Advances in Power System Control, Operation and Management, APSCOM 2006 |
---|---|
Country/Territory | Hong Kong |
City | Hong Kong |
Period | 30/10/06 → 2/11/06 |
Keywords
- Dynamic stability analysis
- Generation rescheduling
- Optimal power flow
- Semi-infinite programming
ASJC Scopus subject areas
- Electrical and Electronic Engineering