An Improved Binary Particle Swarm Optimization For Unit Commitment Problem

摘要

This paper proposes a new improved binary PSO (IBPSO) method to solve the unit commitment (UC) problem, which is integrated binary particle swarm optimization (BPSO) with lambda-iteration method. The IBPSO is improved by priority list based on the unit characteristics and heuristic search strategies to repair the spinning reserve and minimum up/down time constraints. To verify the advantages of the IBPSO method, the IBPSO is tested and compared to the other methods on the systems with the number of units in the range of 10-100. Numerical results demonstrate that the IBPSO is superior to other methods reported in the literature in terms of lower production cost and shorter computational time.