A Reevaluation of the Normal Operating State Control of the Power System Using Computer Control and System Theory Part II: Dispatch Targeting

A three-stage dispatch algorithm is proposed to dispatch economically the load imposed on the area by the customers, while maintaining frequency and tie line schedules. The three stages of the algorithm involve successively shrinking time horizons (one day, one half hour, and one half minute) along with detailed knowledge of the actual load variations and progressively more detailed descriptions of the system. ach algorithm stage draws on the results of the preceding stage and retains those features of the results which depend on the longer horizon of the preceding stage. The algorithm leans for load data on the estimation process presented in Part I. The final output is target curves reaching about 1/2 minute into the future which will be tracked by the power plant controls. This tracking will be discussed in the forthcoming Part III. If the estimation were exact and the unit control instantaneous, the resulting dispatch would be of precisely minimum cost and would be always on schedule in frequency and tie line load. In terms of actual filter and control dynamics this solution will be effective and indeed "optimal". The algorithm can readily incorporate such features as control of inadvertant exchange and jointly owned units, but this incorporation is not discussed in this paper