Short-Term Operational Scheduling of Unit Commitment Using Binary Alternative Moth-Flame Optimization
Soraphon Kigsirisin, Hajime Miyauchi
Abstract
This study proposes a novel binary optimization method for solving unit commitment (UC) problems. Developed from moth-flame optimization (MFO), the proposed method is called binary alternative MFO (BAMFO). Originally, each MFO moth is restricted to fly toward a predetermined flame (solution), causing it to be trapped in the local optimum of that flame and reducing its performance. To address these drawbacks, BAMFO represents four alternative characteristics for moths to discover better flames all over the search space. The exploration and exploitation performances of BAMFO via these characteristics are balanced by a random parameter competing with the criteria of each characteristic. A repair strategy working with the priority list is created to adjust any unit status from the BAMFO simulation to satisfy all UC constraints. Then, Lambda-iteration method is adopted to solve economic dispatch problems. The proficiency of BAMFO is verified in various scales of unit systems for short-term operational scheduling. The results show that BAMFO yields better solutions than do other methods. The Wilcoxon signed rank test was conducted to prove the predominance of BAMFO.