4.6 Article

Multi-Objective Optimal Power Flow Problems Based on Slime Mould Algorithm

期刊

SUSTAINABILITY
卷 13, 期 13, 页码 -

出版社

MDPI
DOI: 10.3390/su13137448

关键词

multi-objective optimization; metaheuristic; optimal power flow; slime mould algorithm

向作者/读者索取更多资源

This paper proposes a solution for solving MOOPF problems based on SMA, considering cost, emission, and transmission line loss as part of the objective functions in a power system. Through investigation of the performance on IEEE 30-, 57-, and 118-bus systems, it is found that SMA provides better solutions compared to other algorithms in the literature, and efficient Pareto fronts can be obtained.
Solving the optimal power flow problems (OPF) is an important step in optimally dispatching the generation with the considered objective functions. A single-objective function is inadequate for modern power systems, required high-performance generation, so the problem becomes multi-objective optimal power flow (MOOPF). Although the MOOPF problem has been widely solved by many algorithms, new solutions are still required to obtain better performance of generation. Slime mould algorithm (SMA) is a recently proposed metaheuristic algorithm that has been applied to solve several optimization problems in different fields, except the MOOPF problem, while it outperforms various algorithms. Thus, this paper proposes solving MOOPF problems based on SMA considering cost, emission, and transmission line loss as part of the objective functions in a power system. The IEEE 30-, 57-, and 118-bus systems are used to investigate the performance of the SMA on solving MOOPF problems. The objective values generated by SMA are compared with those of other algorithms in the literature. The simulation results show that SMA provides better solutions than many other algorithms in the literature, and the Pareto fronts presenting multi-objective solutions can be efficiently obtained.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据