A practical approach to real time economic dispatch considering unit's prohibited operating zones

This paper develops an efficient and practical approach for determining the feasible optimal solution of the economic dispatch problem when some of the online units have prohibited operating zones. When a unit has prohibited operating zones, its operating region will be broken into isolated sub-regions, which results in multiple decision spaces for the economic dispatch problem. For each of the decision spaces, it can be either feasible or unfeasible with respect to the system demand. The feasible optimal solution for the dispatch problem can only reside in one of the feasible, spaces, and can be found by performing the conventional /spl lambda/-/spl delta/ iterative search based on the equal-incremental-cost criterion in each of the feasible spaces. However, for a system with a large number of decision spaces, such an exhaustive search method would not be acceptable in real time operation due to its high computational time requirement. In this paper, a novel approach is proposed. It defines a small and advantageous set of decision spaces, uses an efficient algorithm to determine the most advantageous space and then utilizes the conventional /spl lambda/-/spl delta/ iterative method to find the feasible optimal dispatch solution.<
>