A new binary moth-flame optimization algorithm (BMFOA) - development and application to solve unit commitment problem

Abstract

A binary variant of moth-flame optimizer, namely the binary moth-flame optimizer algorithm (BMFOA) is developed in this chapter and is applied to solve unit commitment (UC) problem in power system operation. The moth-flame algorithm is a bio-inspired optimization algorithm that mimics the traverse navigation mechanism of moth around flames. The navigation mechanism is modelled as a spirally converging approach of moth towards flame. However, the direct application of real-valued moth-flame optimization algorithm (MFOA) to binary matured problems such as UC problem is not possible considering the binary search space attributes. Thus, a binary variant BMFOA is developed via modified sigmoidal transformation of real-valued MFOA. The efficacy of proposed BMFOA is demonstrated through numerical experiments using test systems of different sizes ranging from small-to-medium and large scale. The simulation results are presented, discussed and compared to various existing approaches to solve UC problems. In addition, the statistical significance of BMFOA with respect to other existing approaches is established by performing standard statistical tests such as Friedman, Friedman aligned ranks test, Wilcoxon pairwise test and Quade test. The comparison of statistical test results confirms the statistical significance of proposed BMFOA for solving UC problem of different scales.