Melola Discovery

← Melola Discovery

Open access Journal SINTA 1

Determining optimal location and size of capacitors in radial distribution networks using moth swarm algorithm

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

DOI
10.11591/ijece.v10i5.pp4514-4521
ISSN
2722-2578, 2088-8708
Published
2020-10-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

In this study, the problem of optimal capacitor location and size determination (OCLSD) in radial distribution networks for reducing losses is unraveled by moth swarm algorithm (MSA). MSA is one of the most powerful meta-heuristic algorithm that is taken from the inspiration of the food source finding behavior of moths. Four study cases of installing different numbers of capacitors in the 15-bus radial distribution test system including two, three, four and five capacitors areemployed to run the applied MSA for an investigation of behavior and assessment of performances. Power loss and the improvement of voltage profile obtained by MSA are compared with those fromother methods. As a result, it can be concluded that MSA can give a good truthful and effective solution method for OCLSD problem.

Collaboration network of the authors

40 authors · 117 co-authorship links · 67 across different organisations · showing the 40 most connected

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

  • Ton Duc Thang University
  • Industrial University of Ho Chi Minh City
  • VSB - Technical University of Ostrava
  • Ho Chi Minh City University of Industry and Trade
  • Van Lang University
  • Saigon University
  • Ho Chi Minh City University of Technology
  • Other organisations
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Bach Hoang DinhTon Duc Thang University8
Minh TranAffiliation unknown7
Hung Duc NguyenHo Chi Minh City University of Technology6
Tan Minh PhanTon Duc Thang University5
Chiem Trong HienHo Chi Minh City University of Industry and Trade5
Thanh-Long NguyenHo Chi Minh City University of Industry and Trade4
Phan Nguyen VinhUniversity of Theatre and Cinema Ho Chi Minh City4
Phu Tran TinIndustrial University of Ho Chi Minh City3
Tan Nhat NguyenTon Duc Thang University3
Phu Trieu HaSaigon University3
Trung Dung NguyenIndustrial University of Ho Chi Minh City3
Hoang Nam NguyenTon Duc Thang University2
Hoang-Nam NguyenTon Duc Thang University2
Cong-Trang NguyenTon Duc Thang University2
Hoang-Nam NguyenTon Duc Thang University2
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
Thanh Trang TranHo Chi Minh City University of Industry and Trade1
Thanh Pham VanVSB - Technical University of Ostrava1
Václav SnåšelVSB - Technical University of Ostrava1
Anh Vu LeTon Duc Thang University1
Quang Sy VuVan Lang University1
Miroslav Vozn̆ákVSB - Technical University of Ostrava1
Nguyen Hong NhuSaigon University1
Cuu_Ho VanAffiliation unknown1
Jaroslav ZdrálekVSB - Technical University of Ostrava1
Van Van HuynhTon Duc Thang University1
Hoan Bao LaiTon Duc Thang University1
Anh-Tuan TranAffiliation unknown1
Emmanuel Nduka AmaefuleTon Duc Thang University1
Phong Thanh TranTon Duc Thang University1
Nguyen Duc Huy BuiIndustrial University of Ho Chi Minh City1
Thai Dinh PhamHo Chi Minh City University of Technology and Engineering1

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 Oct 2026, last seen 22 Nov 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>Determining optimal location and size of capacitors in radial distribution networks using moth swarm algorithm</dc:title><dc:creator>Duong, Thanh Long</dc:creator><dc:creator>Nguyen, Thuan Thanh</dc:creator><dc:creator>Phan, Van-Duc</dc:creator><dc:creator>Nguyen, Thang Trung </dc:creator><dc:description>&lt;jats:p&gt;In this study, the problem of optimal capacitor location and size determination (OCLSD) in radial distribution networks for reducing losses is unraveled by moth swarm algorithm (MSA). MSA is one of the most powerful meta-heuristic algorithm that is taken from the inspiration of the food source finding behavior of moths. Four study cases of installing different numbers of capacitors in the 15-bus radial distribution test system including two, three, four and five capacitors areemployed to run the applied MSA for an investigation of behavior and assessment of performances. Power loss and the improvement of voltage profile obtained by MSA are compared with those fromother methods. As a result, it can be concluded that MSA can give a good truthful and effective solution method for OCLSD problem.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2020-10-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.v10i5.pp4514-4521</dc:identifier><dc:identifier>10.11591/ijece.v10i5.pp4514-4521</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 10 No 5 (2020); 4514</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/22209/14159</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>