Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/76472
Title: Multi-objective optimal power flow problems based on slime mould algorithm
Authors: Sirote Khunkitti
Apirat Siritaratiwat
Suttichai Premrudeepreechacharn
Authors: Sirote Khunkitti
Apirat Siritaratiwat
Suttichai Premrudeepreechacharn
Keywords: Energy;Environmental Science;Social Sciences
Issue Date: 1-Jul-2021
Abstract: 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.
URI: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85109390208&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/76472
ISSN: 20711050
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.