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 glob...

Full description

Saved in:
Bibliographic Details
Published inIEEE access Vol. 6; pp. 43535 - 43545
Main Authors Zhao, Jian, Liu, Shixin, Zhou, Mengchu, Guo, Xiwang, Qi, Liang
Format Journal Article
LanguageEnglish
Published Piscataway IEEE 01.01.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
cuckoo search algorithm
Electric power systems
Fuels
heuristic method
Heuristic methods
Mixed integer
Optimization
Power system
Power systems
Search algorithms
Search methods
Search problems
Sociology
Statistics
Unit commitment
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2018.2861319