A Practical Algorithm for Dynamic Optimal Dispatch

Abstract In this paper, the looking ahead constraints of dynamic optimal dispatch are analyzed based on the load-bottleneck-analysis approach. A practical algorithm - two-stage coordination equationsalgorithm is proposed considering the ramp-rate limits and the looking ahead constraints. In the first stage, the initial output of each unit is obtained using the coordination equations algorithm, and then in the second stage, the generation of units is modified if the looking ahead constraints are binding. The strategy of modification is to divide the on-line units into several subsets according to whether a unit can response to the load changes at full speed or not.