By Topic

A network-flow approach for security constrained economic dispatch of power systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ching-Tzong Su ; Inst. of Electr. Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan ; Ying-Chang Hsiao ; Yuh-Chyuan Su

An approach based on transportation technique for economic dispatching of a generation-transmission composite system is presented. Component outages are considered. Through application of the Monte Carlo simulation and the minimum-cost maximum-flow algorithm, this approach searches the cheapest (minimum cost) path of a graph and then determines the maximum flow (minimum capacity of the branches of the cheapest path) for power dispatching. Through repetitive application of the algorithm, a near optimal power flow pattern can be determined and thus security constrained economic dispatch is obtained.

Published in:

Electric Power Engineering, 1999. PowerTech Budapest 99. International Conference on

Date of Conference:

Aug. 29 1999-Sept. 2 1999