This paper presents three versions of particle swarm
optimization to solve unit comment problem. Even though, all
the proposed algorithms provide better numerical convergence,
according to the numerical results, improved binary PSO is
better algorithm than binary PSO for unit commitment
problem. The results further show that LR-PSO does not
provide the best results for small sized system and it gives the
best result for large sized systems. In addition, LR-PSO has
more attractiveness as discussed above particularly for the
systems containing large number of generating units.
Fast numerical convergence and easy implementation are
some of the main attractive features of PSO algorithms in
solving UC problem. In addition, the proposed PSO algorithms
can be easily extended to solve new profit-based unit
commitment problem under the competitive environment.