A novel approach for unit commitment problem via an effective hybrid particle swarm optimization

This paper presents a new approach via hybrid particle swarm optimization (HPSO) scheme to solve the unit commitment (UC) problem. HPSO proposed in this paper is a blend of binary particle swarm optimization (BPSO) and real coded particle swarm optimization (RCPSO). The UC problem is handled by BPSO, while RCPSO solves the economic load dispatch problem. Both algorithms are run simultaneously, adjusting their solutions in search of a better solution. Problem formulation of the UC takes into consideration the minimum up and down time constraints, start-up cost, and spinning reserve and is defined as the minimization of the total objective function while satisfying all the associated constraints. Problem formulation, representation, and the simulation results for a ten generator-scheduling problem are presented. Results clearly show that HPSO is very competent in solving the UC problem in comparison to other existing methods