Power generation scheduling through use of generalised network flow programming

Author

Rice, R.E. ; Grady, W.M. ; Lesso, W.G. ; Noyola, A.H. ; Connolly, M.E.

Author_Institution

Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA

Volume

138

Issue

1

fYear

1991

fDate

1/1/1991 12:00:00 AM

Firstpage

39

Lastpage

46

Abstract

The authors present a constrained economic dispatch (CED) formulation that is based upon generalised network flow programming (GNFP). The methodology for applying GNFP to the CED problem is developed and illustrated using four examples: 5, 39, 264, and 515-bus systems. Starting with a solved loadflow case, execution times for the CED are shown to be about the same as for a Newton-Raphson loadflow, and memory requirements are approximately 75% of the loadflow. Salient features of the CED-GNFP method include the ability to minimise generation cost while meeting constraints on line flows and area interchange. Network location of loads and generators is automatically considered without need of penalty factors, and transmission line flow limits do not affect solution times significantly

Keywords

electric power generation; load dispatching; load flow; power transmission lines; scheduling; CED; GNFP; constrained economic dispatch; generalised network flow programming; generation cost; loadflow; memory requirements; power generation scheduling; transmission line flow limits;

fLanguage

English

Journal_Title

Generation, Transmission and Distribution, IEE Proceedings C

Publisher

iet

ISSN

0143-7046

Type

jour

Filename

61652