An Improved Binary Cuckoo Search Algorithm for Solving Unit Commitment Problems: Methodological Description

The unit commitment problem is a large-scale, nonlinear, and mixed-integer optimization problem in an electric power system. Numerous researchers concentrate on minimizing its total generation cost. Cuckoo search is an efficient metaheuristic swarm-based approach that balances between local and global search strategy. Owing to its easy implementation and rapid convergence, it has been successfully used to solve a wide variety of optimization problems. This paper proposes an improved binary cuckoo search algorithm (IBCS) for solving the unit commitment problem. A new binary updating mechanism is introduced to help the IBCS choose a right search direction, and a heuristic search method based on a novel priority list can prevent it from being trapped into local optima. A 4-unit system is used as an example to validate the effectiveness of the proposed method.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.