.png){kind=icon}
返回
Application of Binary Slime Mould Algorithm for Solving Unit Commitment Problem
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2023.3273928.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Optimization
Costs
Convergence
Fuels
Metaheuristics
Power generation
Heuristic algorithms
Binary slime mould algorithm (BSMA)
heuristic optimization algorithm
unit commitment problem (UCP)
economic load dispatch (ELD)
power system optimization
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
分享收藏Binary Horse herd optimization algorithm with crossover operators for feature selection基于交叉算子的特征选择二元马群优化算法
PREAI
分享收藏分享收藏分享收藏INFO: An efficient optimization algorithm based on weighted mean of vectorsINFO: 一种基于向量加权均值的高效优化算法
PREAI
分享收藏Unit Commitment by improved pre-prepared power demand table and Muller method通过改进的预先编制的电力需求表和穆勒法进行机组承诺
PREAI
分享收藏
查看更多内容