논문 해외 국제전문학술지(SCI급) Application of Binary Slime Mould Optimization Algorithm for solving Unit Commitment Problem
- 학술지 구분 국제전문학술지(SCI급)
- 게재년월 2023-05
- 저자명 Md. Sayed Hasan Rifat, Md. Ashaduzzaman Niloy, Mutasim Fuad Rizvi, Ashik Ahmed, Razzaqul Ahshan, Sarvar Hussain Nengroo, Sangkeum Lee
- 학술지명 IEEE Access
- 발행국가 해외
- 전체저자수 7
- 원문 링크 https://doi.org/10.1109/ACCESS.2023.3273928
홈페이지논문 초록 (Abstract)
A challenging engineering optimization problem in electrical power generation is the unit commitment problem (UCP). Determining the scheduling for the economic consumption of production assets over a specific period is the premier objective of UCP. This paper presents a take on solving UCP with Binary Slime Mould Algorithm (BSMA). SMA is a recently created optimization method that draws inspiration from nature and mimics the vegetative growth of slime mould. A binarized SMA with constraint handling is proposed and implemented to UCP to generate optimal scheduling for available power resources. To test BSMA as a UCP optimizer, IEEE standard generating systems ranging from 10 to 100 units along with IEEE 118-bus system are used, and the results are then compared with existing approaches. The comparison reveals the superiority of BSMA over all the classical and evolutionary approaches and most of the hybridized methods considered in this paper in terms of total cost and convergence characteristics.