Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

Optimal protective relaying scheme of distributed generation connected distribution network using particle swarm optimization-gravitational search algorithm technique

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 13 No. 3 (2023)

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

Abstract

This paper develops particle swarm optimization integrated with gravitational search algorithm (PSO-GSA) to coordinate the relays in a distribution system with distributed generation (DG) connectivity. This algorithm combines PSO and GSA to improve the performance of the relay protection system. To prevent relay malfunctions following DG penetration, a suitable primary and backup relay is chosen. The PSO-GSA is coded using MATLAB software and tested on an IEEE 4-bus system simulated in Simulink. Results indicate that, when compared to using regular PSO and GSA procedures individually, the PSO-GSA technique reduces the operating time of the relay significantly.

Collaboration network of the authors

3 authors · 2 co-authorship links · 1 across different organisations

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

  • Visvesvaraya Technological University
  • Acharya Institute of Technology
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Rekha RekhaAcharya Institute of Technology1

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>Optimal protective relaying scheme of distributed generation connected distribution network using particle swarm optimization-gravitational search algorithm technique</dc:title><dc:creator>Bheemasenarao, Arathi Pothakanahalli</dc:creator><dc:creator>Byalihal, Shankaralingappa C</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;span lang="EN-US"&amp;gt;This paper develops particle swarm optimization integrated with gravitational search algorithm (PSO-GSA) to coordinate the relays in a distribution system with distributed generation (DG) connectivity. This algorithm combines PSO and GSA to improve the performance of the relay protection system. To prevent relay malfunctions following DG penetration, a suitable primary and backup relay is chosen. The PSO-GSA is coded using MATLAB software and tested on an IEEE 4-bus system simulated in Simulink. Results indicate that, when compared to using regular PSO and GSA procedures individually, the PSO-GSA technique reduces the operating time of the relay significantly.&amp;lt;/span&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2023-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.v13i3.pp2568-2578</dc:identifier><dc:identifier>10.11591/ijece.v13i3.pp2568-2578</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 13 No 3 (2023); 2568</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>https://ijece.iaescore.com/index.php/IJECE/article/viewFile/29228/16501</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>