Unit Commitment by a Fast and New Analytical Non-iterative Method Using IPPD Table and “λ-logic” Algorithm

Many different methods have been presented to solve unit commitment (UC) problem in literature with different advantages and disadvantages. The need for multiple runs, huge computational burden and time, and poor convergence are some of the disadvantages, where are especially considerable in large scale systems. In this paper, a new analytical and non-iterative method is presented to solve UC problem. In the proposed method, improved pre-prepared power demand (IPPD) table is used to solve UC problem, and then analytical “λ-logic” algorithm is used to solve economic dispatch (ED) sub-problem. The analytical and non-iterative nature of the mentioned methods results in simplification of the UC problem solution. Obtaining minimum cost in very small time with only one run is the major advantage of the proposed method. The proposed method has been tested on ۱۰ unit and ۴۰-۱۰۰ unit systems with consideration of different constraints, such as: power generation limit of units, reserve constraints, minimum up and down times of generating units. Comparing the simulation results of the proposed method with other methods in literature shows that in large scale systems, the proposed method achieves minimum operational cost within minimum computational time.

Keywords:

Unit commitment , Economic Dispatch , IPPD table , “λ-logic” algorithm