Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

Evolutionary algorithm solution for economic dispatch problems

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 12 No. 3 (2022)

DOI
10.11591/ijece.v12i3.pp2963-2970
ISSN
2722-2578, 2088-8708
Published
2022-06-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

A modified firefly algorithm (FA) was presented in this paper for finding a solution to the economic dispatch (ED) problem. ED is considered a difficult topic in the field of power systems due to the complexity of calculating the optimal generation schedule that will satisfy the demand for electric power at the lowest fuel costs while satisfying all the other constraints. Furthermore, the ED problems are associated with objective functions that have both quality and inequality constraints; these include the practical operation constraints of the generators (such as the forbidden working areas, nonlinear limits, and generation limits) that makes the calculation of the global optimal solutions of ED a difficult task. The proposed approach in this study was evaluated in the IEEE 30-Bus test-bed; the evaluation showed that the proposed FA-based approach performed optimally in comparison with the performance of the other existing optimizers, such as the traditional FA and particle swarm optimization. The results show the high performance of the modified firefly algorithm compared to the other methods.

Collaboration network of the authors

No co-authors found in Melola yet.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Evolutionary algorithm solution for economic dispatch problems</dc:title><dc:creator>Hussein, Balasim Mohammed</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;span&amp;gt;A modified firefly algorithm (FA) was presented in this paper for finding a solution to the economic dispatch (ED) problem. ED is considered a difficult topic in the field of power systems due to the complexity of calculating the optimal generation schedule that will satisfy the demand for electric power at the lowest fuel costs while satisfying all the other constraints. Furthermore, the ED problems are associated with objective functions that have both quality and inequality constraints; these include the practical operation constraints of the generators (such as the forbidden working areas, nonlinear limits, and generation limits) that makes the calculation of the global optimal solutions of ED a difficult task. The proposed approach in this study was evaluated in the IEEE 30-Bus test-bed; the evaluation showed that the proposed FA-based approach performed optimally in comparison with the performance of the other existing optimizers, such as the traditional FA and particle swarm optimization. The results show the high performance of the modified firefly algorithm compared to the other methods.&amp;lt;/span&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2022-06-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v12i3.pp2963-2970</dc:identifier><dc:identifier>10.11591/ijece.v12i3.pp2963-2970</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 12 No 3 (2022); 2963</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/23630/15682</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>