Optimal load shedding and generation rescheduling for overload suppression in large power systems Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/z603r080h

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Ever-increasing size, complexity and operation costs in modern power systems have stimulated the intensive study of an optimal Load Shedding and Generator Rescheduling (LSGR) strategy in the sense of a secure and economic system operation. The conventional approach to LSGR has been based on the application of LP (Linear Programming) with the use of an appropriately linearized model, and the LP algorithm is currently considered to be the most powerful tool for solving the LSGR problem. However, all of the LP algorithms presented in the literature essentially lead to the following disadvantages: (i) piecewise linearization involved in the LP algorithms requires the introduction of a number of new inequalities and slack variables, which creates significant burden to the computing facilities, and (ii) objective functions are not formulated in terms of the state variables of the adopted models, resulting in considerable numerical inefficiency in the process of computing the optimal solution. A new approach is presented, based on the development of a new linearized model and on the application of QP (Quadratic Programming). The changes in line flows as a result of changes to bus injection power are taken into account in the proposed model by the introduction of sensitivity coefficients, which avoids the mentioned second disadvantages. A precise method to calculate these sensitivity coefficients is given. A comprehensive review of the theory of optimization is included, in which results of the development of QP algorithms for LSGR as based on Wolfe's method and Kuhn-Tucker theory are evaluated in detail. The validity of the proposed model and QP algorithms has been verified and tested on practical power systems, showing the significant reduction of both computation time and memory requirements as well as the expected lower generation costs of the optimal solution as compared with those obtained from computing the optimal solution with LP. Finally, it is noted that an efficient reactive power compensation algorithm is developed to suppress voltage disturbances due to load sheddings, and that a new method for multiple contingency simulation is presented.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome, 24-bit Color) using ScandAll PRO 1.8.1 on a Fi-6670 in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2013-07-29T19:57:07Z (GMT). No. of bitstreams: 1 MoonYoungHyun1983.pdf: 6941946 bytes, checksum: 878be6f837dbedb6a94407c1e2d4ba0e (MD5) Previous issue date: 1982-10-28
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2013-07-29T16:52:19Z (GMT) No. of bitstreams: 1 MoonYoungHyun1983.pdf: 6941946 bytes, checksum: 878be6f837dbedb6a94407c1e2d4ba0e (MD5)
  • description.provenance : Approved for entry into archive by Deborah Campbell(deborah.campbell@oregonstate.edu) on 2013-07-29T19:57:07Z (GMT) No. of bitstreams: 1 MoonYoungHyun1983.pdf: 6941946 bytes, checksum: 878be6f837dbedb6a94407c1e2d4ba0e (MD5)
  • description.provenance : Submitted by Katy Davis (kdscannerosu@gmail.com) on 2013-07-24T21:37:39Z No. of bitstreams: 1 MoonYoungHyun1983.pdf: 6941946 bytes, checksum: 878be6f837dbedb6a94407c1e2d4ba0e (MD5)

Relationships

In Administrative Set:
Last modified: 08/07/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items