An improved binary particle swarm optimization for unit commitment problem

This paper proposed a new approach combining priority list (PL) with binary particle swarm optimization (BPSO) to solve unit commitment (UC) problem. At first, PL method was used to determine the initial UC, and then the optimization window was determined according to the results, at last the BPSO method was adopted to solve the UC problem within the window. The window is to reduce the computing time and improve the optimization accuracy. In each iteration, the adjustment heuristic strategy was applied to revise the particle to meet the generators´ constraints. This paper adopted Lambda-iteration method combining with dichotomy algorithm to solve the economic dispatch (ED) problem. The simulation results showed that the proposed method is indeed capable of obtaining higher quality solutions.