Modified Binary Differential Evolution Algorithm to Solve Unit Commitment Problem

Abstract

Unit commitment problem with huge number of constraints is considered as an important optimization problem encountered in the electric power systems. This paper proposes a modified binary differential evolution (MBDE) inspired by the idea of estimation of distribution and differential evolution algorithms to solve the multi-constrained unit commitment problem. The updating strategy of the standard differential evolution (DE) is reserved in the proposed MBDE so that the excellent characteristics of DE, such as easy implementation and parameter tuning, are inherited. A new probability estimator operator is applied in MBDE, which efficiently preserves the diversity of population and boost the global search ability. Further, this paper also explores various priority methods based on unit characteristics for unit scheduling and allocating the power to committed units. The effectiveness of proposed method has been investigated on the small scale to large scale power systems ranging from 10 to 100 generating units for 24 hours scheduling period. Results are validated by performing comparison with previously published research papers. Simulated results achieved by proposed method are found superior to the previously reported algorithms used to solve the unit commitment problem. A Wilcoxon signed rank test for paired samples also proves predominance of the proposed MBDE algorithm.

Keywords:

• Unit commitment problem
• economic power dispatch
• modified binary differential evolution