TY - JOUR
T1 - Application of Binary Slime Mould Algorithm for Solving Unit Commitment Problem
AU - Rifat, Md Sayed Hasan
AU - Niloy, Md Ashaduzzaman
AU - Rizvi, Mutasim Fuad
AU - Ahmed, Ashik
AU - Ahshan, Razzaqul
AU - Nengroo, Sarvar Hussain
AU - Lee, Sangkeum
N1 - Publisher Copyright:
© 2013 IEEE.
DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.
PY - 2023/1/1
Y1 - 2023/1/1
N2 - 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.
AB - 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.
KW - Binary slime mould algorithm (BSMA)
KW - economic load dispatch (ELD)
KW - heuristic optimization algorithm
KW - power system optimization
KW - unit commitment problem (UCP)
UR - http://www.scopus.com/inward/record.url?scp=85159743248&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85159743248&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2023.3273928
DO - 10.1109/ACCESS.2023.3273928
M3 - Article
AN - SCOPUS:85159743248
SN - 2169-3536
VL - 11
SP - 45279
EP - 45300
JO - IEEE Access
JF - IEEE Access
ER -