Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

Hybrid method for solving the non smooth cost function economic dispatch problem

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 10 No. 1 (2020)

DOI
10.11591/ijece.v10i1.pp609-616
ISSN
2088-8708, 2088-8708
Published
2020-02-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-nc/4.0

Abstract

This article is focused on hybrid method for solving the non-smooth cost function economic dispatch problem. The techniques were divided into two parts according to: the incremental cost rates are used to find the initial solution and bee colony optimization is used to find the optimal solution. The constraints of economic dispatch are power losses, load demand and practical operation constraints of generators. To verify the performance of the proposed algorithm, it is operated by the simulation on the MATLAB program and tests three case studies; three, six and thirteen generator units which compared to particle swarm optimization, cuckoo search algorithm, bat algorithm, firefly algorithm and bee colony optimization. The results show that the proposed algorithm is able to obtain higher quality solution efficiently than the others methods.

Collaboration network of the authors

5 authors · 8 co-authorship links · 3 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Rajamangala University of Technology Lanna
  • Mahasarakham University
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Thawinan JanthawangRajamangala University of Technology Lanna2
Apinan AurasoponMahasarakham University2

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

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>Hybrid method for solving the non smooth cost function economic dispatch problem</dc:title><dc:creator>Khamsen, Wanchai</dc:creator><dc:creator>Takeang, Chiraphon</dc:creator><dc:creator>Aunban, Patiphat</dc:creator><dc:description>&lt;jats:p&gt;This article is focused on hybrid method for solving the non-smooth cost function economic dispatch problem. The techniques were divided into two parts according to: the incremental cost rates are used to find the initial solution and bee colony optimization is used to find the optimal solution. The constraints of economic dispatch are power losses, load demand and practical operation constraints of generators. To verify the performance of the proposed algorithm, it is operated by the simulation on the MATLAB program and tests three case studies; three, six and thirteen generator units which compared to particle swarm optimization, cuckoo search algorithm, bat algorithm, firefly algorithm and bee colony optimization. The results show that the proposed algorithm is able to obtain higher quality solution efficiently than the others methods.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2020-02-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.v10i1.pp609-616</dc:identifier><dc:identifier>10.11591/ijece.v10i1.pp609-616</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 10 No 1 (2020); 609</dc:source><dc:source>2088-8708</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/14204/pdf</dc:relation><dc:rights>http://creativecommons.org/licenses/by-nc/4.0</dc:rights></oai_dc:dc>