Short-Term Operational Scheduling of Unit Commitment Using Binary Alternative Moth-Flame Optimization
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), causin...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2021-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9319868/ |