Unit Commitment Solution Using Shuffled Complex Evolution with Principal Component Analysis

This paper proposes Unit Commitment solution based on the Shuffled complex evolution with Principal component analysis algorithm-University of California at Irvine. The features of the proposed algorithm are: It solves the problem of population degeneration. It combines the strength of shuffled complex, the Nelder-Mead simplex and multi-normal re-sampling to achieve efficient optimization. By representing the chromosome intelligently, the chromosome length and population size is reduced. The effectiveness of the proposed algorithm is tested on standard 10, 40, 80 and 100 units, 24 hour power system. Simulation results obtained illustrate that the proposed algorithm can produce global optimal solution compared to that of other reported methods.