Абстрактный

Profit based unit commitment using IPPDT and genetic algorithm

A.Prakash, M.Yuvaraj

The proposes a new methodology for solve the Profit Based Unit Commitment (PBUC) problem. The UC problem is solving to Improved Pre-prepared Power Demand (IPPD) table. In a deregulated environment, generation companies (GENCOs) schedule their generators to maximize profits rather than to satisfy power demand The proposed approach has been tested on 3- and 10 units for a scheduling horizon of 24 Comparison of results of the proposed method with the results of previous published methods shows that the proposed approach provides better qualitative solution with less computational time.