Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Optimization of location and size of distributed generations for maximizing their capacity and minimizing power loss of distribution system based on cuckoo search algorithm

Bulletin of Electrical Engineering and Informatics · Vol. 10 No. 4 (2021) · hlm. 1769–1776

DOI
10.11591/eei.v10i4.2278
ISSN
2089-3191, 2302-9285
Terbit
2021-07-07
Penerbit
Institute of Advanced Engineering and Science (IAES)
Bahasa
en
Lisensi
creativecommons.org/licenses/by-sa/4.0/

Abstrak

Maximizing capacity of distributed generations (DGs) embed into distribution network is a solution to attract investment for DGs installation on the distribution system. This paper introduces a approach of optimizing location and capacity of DGs for maximizing DGs capacity and minimizing the system’s power loss based on cuckoo search algorithm (CSA). The proposed problem and method are simulated on two test systems including the 33-node and 69-node networks. The numerical results have demonstrated that the proposed method not only reduces power losses but also maximizes the power of DGs embed into the distribution network. The results also introduce that the proposed CSA method is better performance that some previous methods in terms of power loss and DGs capacity. The results obtained in many independent runs for two test systems indicate that CSA in one of the reliable methods for the DGs placement problems.

Kata kunci

Jaringan kolaborasi para penulis

34 penulis · 92 tautan kepenulisan bersama · 53 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
  • Ho Chi Minh City University of Technology and Engineering
  • Ton Duc Thang University
  • Saigon University
  • VSB - Technical University of Ostrava
  • Cao Thang Technical College
  • 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
Thanh Long DuongIndustrial University of Ho Chi Minh City9
Van-Duc PhanVan Lang University8
Bach Hoang DinhTon Duc Thang University5
Hung Duc NguyenHo Chi Minh City University of Technology4
Tan Minh PhanTon Duc Thang University3
Chiem Trong HienHo Chi Minh City University of Industry and Trade3
Trung Dung NguyenIndustrial University of Ho Chi Minh City3
Phu Trieu HaSaigon University2
Phan Nguyen VinhUniversity of Theatre and Cinema Ho Chi Minh City2
Trong Nghia LeHo Chi Minh City University of Technology and Engineering2
Tran Trong DaoTon Duc Thang University2
Ly Huu PhamTon Duc Thang University2
Thanh Pham VanVSB - Technical University of Ostrava1
Václav SnåšelVSB - Technical University of Ostrava1
Trieu Tan PhungCao Thang Technical College1
Anh Huy QuyenHo Chi Minh City University of Technology and Engineering1
Phung Bao Long NguyenAfiliasi tidak diketahui1
Ngoc Anh NguyenIndustrial University of Ho Chi Minh City1
Thanh Quyen NgoIndustrial University of Ho Chi Minh City1
Thanhquy BachIndustrial University of Ho Chi Minh City1
Tung Giang TranAfiliasi tidak diketahui1
Thai An NguyenCao Thang Technical College1
Thi Ngoc Thuong HuynhAfiliasi tidak diketahui1
Nguyen Hoai PhongIndustrial University of Ho Chi Minh City1
Thai Dinh PhamHo Chi Minh City University of Technology and Engineering1
Le Chi KienHo Chi Minh City University of Technology and Engineering1
Nguyễn Duy PhươngSaigon University1
Bao Quoc NguyenTon 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">Optimization of location and size of distributed generations for maximizing their capacity and minimizing power loss of distribution system based on cuckoo search algorithm</dc:title><dc:creator>Thuan Thanh Nguyen</dc:creator><dc:creator>Trieu Ton Ngoc</dc:creator><dc:creator>Thang Trung Nguyen</dc:creator><dc:creator>Thanh-Phuc Nguyen</dc:creator><dc:creator>Ngoc Au Nguyen</dc:creator><dc:subject>distributed generation</dc:subject><dc:subject>distributed generation placement</dc:subject><dc:subject>DG sizing</dc:subject><dc:subject>power loss reduction</dc:subject><dc:subject>cuckoo search algorithm</dc:subject><dc:subject>distribution systems</dc:subject><dc:subject>metaheuristic optimization</dc:subject><dc:description xml:lang="en">Maximizing capacity of distributed generations (DGs) embed into distribution network is a solution to attract investment for DGs installation on the distribution system. This paper introduces a approach of optimizing location and capacity of DGs for maximizing DGs capacity and minimizing the system’s power loss based on cuckoo search algorithm (CSA). The proposed problem and method are simulated on two test systems including the 33-node and 69-node networks. The numerical results have demonstrated that the proposed method not only reduces power losses but also maximizes the power of DGs embed into the distribution network. The results also introduce that the proposed CSA method is better performance that some previous methods in terms of power loss and DGs capacity. The results obtained in many independent runs for two test systems indicate that CSA in one of the reliable methods for the DGs placement problems.</dc:description><dc:publisher>Institute of Advanced Engineering and Science (IAES)</dc:publisher><dc:date>2021-07-07</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.v10i4.2278</dc:identifier><dc:identifier>10.11591/eei.v10i4.2278</dc:identifier><dc:source>Bulletin of Electrical Engineering and Informatics; Vol 10 No 4 (2021); 1769-1776</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/2278/2285</dc:relation><dc:rights>https://creativecommons.org/licenses/by-sa/4.0/</dc:rights></oai_dc:dc>