Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Application of a new constraint handling method for economic dispatch considering electric market

Bulletin of Electrical Engineering and Informatics · Vol. 9 No. 4 (2020) · hlm. 1542–1549

DOI
10.11591/eei.v9i4.2351
ISSN
2089-3191, 2302-9285
Terbit
2020-08-01
Penerbit
Institute of Advanced Engineering and Science (IAES)
Bahasa
en

Abstrak

In this paper, optimal load dispatch problem under competitive electric market (OLDCEM) is solved by the combination of cuckoo search algorithm (CSA) and a new constraint handling approach, called modified cuckoo search algorithm (MCSA). In addition, we also employ the constraint handling method for salp swarm algorithm (SSA) and particle swarm optimization algorithm (PSO) to form modified SSA (MSSA) and modified PSO (MPSO). The three methods have been tested on 3-unit system and 10-unit system under the consideration of payment model for power reserve allocated, and constraints of system and generators. Result comparisons among MCSA and CSA indicate that the proposed constraint handling method is very useful for metaheuristic algorithms when solving OLDCEM problem. As compared to MSSA, MPSO as well as other previous methods, MCSA is more effective by finding higher total benefit for the two systems with faster manner and lower oscillations. Consequently, MCSA method is a very effective technique for OLDCEM problem in power systems.

Kata kunci

Jaringan kolaborasi para penulis

31 penulis · 81 tautan kepenulisan bersama · 49 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Industrial University of Ho Chi Minh City
  • Ton Duc Thang University
  • Ho Chi Minh City University of Technology and Engineering
  • Saigon University
  • VSB - Technical University of Ostrava
  • Ho Chi Minh City University of Technology
  • Van Lang University
  • Organisasi lain
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Van-Duc PhanVan Lang University10
Hung Duc NguyenHo Chi Minh City University of Technology7
Bach Hoang DinhTon Duc Thang University5
Tan Minh PhanTon Duc Thang University4
Chiem Trong HienHo Chi Minh City University of Industry and Trade4
Phu Trieu HaSaigon University3
Trung Dung NguyenIndustrial University of Ho Chi Minh City3
Phan Nguyen VinhUniversity of Theatre and Cinema Ho Chi Minh City2
Tran Trong DaoTon Duc Thang University2
Ngoc Anh NguyenIndustrial University of Ho Chi Minh City2
Thanh Quyen NgoIndustrial University of Ho Chi Minh City2
Thanhquy BachIndustrial University of Ho Chi Minh City2
Nguyen Hoai PhongIndustrial University of Ho Chi Minh City2
Ngoc Au NguyenHo Chi Minh City University of Technology and Engineering2
Trieu Ton NgocHo Chi Minh City University of Technology and Engineering2
Thanh-Phuc NguyenIndustrial University of Ho Chi Minh City2
Thanh Pham VanVSB - Technical University of Ostrava1
Václav SnåšelVSB - Technical University of Ostrava1
Nguyen Duc Huy BuiIndustrial University of Ho Chi Minh City1
Thai Dinh PhamHo Chi Minh City University of Technology and Engineering1
Chi Trung TruongAfiliasi tidak diketahui1
Quoc Trung NguyenAfiliasi tidak diketahui1
Le Chi KienHo Chi Minh City University of Technology and Engineering1
Nguyễn Duy PhươngSaigon University1
Bao Quoc NguyenTon Duc Thang University1
Minh Phuc DuongTon Duc Thang University1
Ngoc Thiem NguyenIndustrial University of Ho Chi Minh City1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OpenAlex API (jurnal SINTA, ADR 0048) https://openalex.org/S2765016208, pertama di-harvest 19 Nov 2026, terakhir terlihat 19 Nov 2026.
Metadata asli (oai_dc)
<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 xml:lang="en">Application of a new constraint handling method for economic dispatch considering electric market</dc:title><dc:creator>Thanh Long Duong</dc:creator><dc:creator>Ly Huu Pham</dc:creator><dc:creator>Thuan Thanh Nguyen</dc:creator><dc:creator>Thang Trung Nguyen</dc:creator><dc:subject>economic dispatch</dc:subject><dc:subject>constraint handling</dc:subject><dc:subject>cuckoo search algorithm</dc:subject><dc:subject>salp swarm algorithm</dc:subject><dc:subject>particle swarm optimization</dc:subject><dc:subject>generator constraints</dc:subject><dc:subject>metaheuristic optimization</dc:subject><dc:description xml:lang="en">In this paper, optimal load dispatch problem under competitive electric market (OLDCEM) is solved by the combination of cuckoo search algorithm (CSA) and a new constraint handling approach, called modified cuckoo search algorithm (MCSA). In addition, we also employ the constraint handling method for salp swarm algorithm (SSA) and particle swarm optimization algorithm (PSO) to form modified SSA (MSSA) and modified PSO (MPSO). The three methods have been tested on 3-unit system and 10-unit system under the consideration of payment model for power reserve allocated, and constraints of system and generators. Result comparisons among MCSA and CSA indicate that the proposed constraint handling method is very useful for metaheuristic algorithms when solving OLDCEM problem. As compared to MSSA, MPSO as well as other previous methods, MCSA is more effective by finding higher total benefit for the two systems with faster manner and lower oscillations. Consequently, MCSA method is a very effective technique for OLDCEM problem in power systems.</dc:description><dc:publisher>Institute of Advanced Engineering and Science (IAES)</dc:publisher><dc:date>2020-08-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/eei.v9i4.2351</dc:identifier><dc:identifier>10.11591/eei.v9i4.2351</dc:identifier><dc:source>Bulletin of Electrical Engineering and Informatics; Vol 9 No 4 (2020); 1542-1549</dc:source><dc:source>2089-3191</dc:source><dc:source>2302-9285</dc:source><dc:language>en</dc:language><dc:relation>https://beei.org/index.php/EEI/article/download/2351/1519</dc:relation></oai_dc:dc>