Large Scale Dynamic Programming Based Dispatch Including Transmission Losses

Abstract

A new technique for economic dispatch based on the principle of dynamic programming and including both transmission limits and loss representation is presented. Despite the general view that DP is inherently time consumming and requires enormous computer memory, the method described here has neither of these disadvantages. It has many desirable characteristics including numerical stability, high speed, high accuracy and superior capability in handling non-linear, non-convex generation costs. Individual line flow constraints are considered and the costs of transmission losses are included within the overall minimization stategy. Generating units in a station connected to the same busbar need not neccessarily be lumped into a single entity but can be modelled separately. Because of its speed, the approach is potentially suitable for on-line application even for a very large system. The theoretical derivation of the method is presented and numerical results on applications to various networks including a data set from CEGB are reported.