Show simple item record

dc.contributor.authorJavadi, Milad
dc.date.accessioned2019-10-09T17:00:29Z
dc.date.available2019-10-09T17:00:29Z
dc.date.created2014
dc.identifier.urihttps://hdl.handle.net/11244/321492
dc.descriptionM.S.--University of Oklahoma, 2014.
dc.descriptionIncludes bibliographical references (leaves 47-48).
dc.description.abstractThe number and the locations of transmission lines that are likely to get simultaneously congested is a useful piece of information for power system operation, and activities in the power markets. This study presents, a novel algorithm for estimation of a smaller set of transmission lines that have high probability of being simultaneously congested. To this end, first, the maximum number of simultaneously congested lines is investigated. Then, the algorithm and the corresponded criteria are developed to identify such a smaller group of lines. The algorithm is developed based on two mathematical methods of operation research, which are modified with respect to the features of optimal power flow problem. Moreover, using the insights obtained from the study of the characteristics of frequently congested lines distribution, an index is developed to prioritize the lines with respect to their probability of being congested. The proposed algorithm is also illustrated by simulation of a power market based system.
dc.format.extentviii, 55 leaves
dc.format.mediumviii, 55 leaves : color illustrations ; 28 cm
dc.language.isoeng
dc.subject.lcshElectric power transmission
dc.subject.lcshElectric power distribution
dc.titleIdentification of simultaneously congested transmission lines in power market
dc.typeText
dc.contributor.committeeMemberTang, Choon Yik
dc.contributor.committeeMemberHavlicek, Joseph, P.
dc.contributor.committeeMemberJiang, John, N.
ou.groupSchool of Electrical and Computer Engineering


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record