Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Best-worst northern goshawk optimizer: a new stochastic optimization method

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

DOI
10.11591/ijece.v13i6.pp7016-7026
ISSN
2722-2578, 2088-8708
Terbit
2023-12-01
Penerbit
Institute of Advanced Engineering and Science
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

This study introduces a new metaheuristic method: the best-worst northern goshawk optimizer (BW-NGO). This algorithm is an enhanced version of the northern goshawk optimizer (NGO). Every BW-NGO iteration consists of four phases. First, each agent advances toward the best agent and away from the worst agent. Second, each agent moves relatively to the agent selected at random. Third, each agent conducts a local search. Fourth, each agent traces the space at random. The first three phases are mandatory, while the fourth phase is optional. Simulation is performed to assess the performance of BW-NGO. In this simulation, BW-NGO is confronted with four algorithms: particle swarm optimization (PSO), pelican optimization algorithm (POA), golden search optimizer (GSO), and northern goshawk optimizer (NGO). The result exhibits that BW-NGO discovers an acceptable solution for the 23 benchmark functions. BW-NGO is better than PSO, POA, GSO, and NGO in consecutively optimizing 22, 20, 15, and 11 functions. BW-NGO can discover the global optimal solution for three functions.

Jaringan kolaborasi para penulis

16 penulis · 37 tautan kepenulisan bersama · 4 lintas organisasi

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

  • Telkom University
  • Institut Teknologi Telkom Surabaya
  • 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
Helmy WidyantaraInstitut Teknologi Telkom Surabaya3
Meta KallistaTelkom University2
Axel DavidTelkom University2
Panji Christoper SilalahiTelkom University2
Yohanes Yogas HerlambangTelkom University2
Muhammad Dwi HariyantoTelkom University1
Seno Adi PutraTelkom University1
Andrew Brian OsmondTelkom University1
Budhi IrawanTelkom University1
Rifqi Muhammad FikriTelkom University1
Muhammad Riyadhul Jinan NasutionTelkom University1
Faiq HaqqaniTelkom University1
Raenaldi Ardiansyah SidikTelkom University1
Ratna Astuti NugrahaeniTelkom University1

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.

Data ini berasal dari Crossref (yang disetorkan penerbit), karena endpoint OAI-PMH milik jurnal tidak dapat di-harvest.

Sumber metadata: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, pertama di-harvest 27 Okt 2026, terakhir terlihat 15 Nov 2026.
Metadata sebagai oai_dc, dikonversi dari 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>Best-worst northern goshawk optimizer: a new stochastic optimization method</dc:title><dc:creator>Kusuma, Purba Daru</dc:creator><dc:creator>Hasibuan, Faisal Candrasyah</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;span lang="EN-US"&amp;gt;This study introduces a new metaheuristic method: the best-worst northern goshawk optimizer (BW-NGO). This algorithm is an enhanced version of the northern goshawk optimizer (NGO). Every BW-NGO iteration consists of four phases. First, each agent advances toward the best agent and away from the worst agent. Second, each agent moves relatively to the agent selected at random. Third, each agent conducts a local search. Fourth, each agent traces the space at random. The first three phases are mandatory, while the fourth phase is optional. Simulation is performed to assess the performance of BW-NGO. In this simulation, BW-NGO is confronted with four algorithms: particle swarm optimization (PSO), pelican optimization algorithm (POA), golden search optimizer (GSO), and northern goshawk optimizer (NGO). The result exhibits that BW-NGO discovers an acceptable solution for the 23 benchmark functions. BW-NGO is better than PSO, POA, GSO, and NGO in consecutively optimizing 22, 20, 15, and 11 functions. BW-NGO can discover the global optimal solution for three functions.&amp;lt;/span&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2023-12-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.v13i6.pp7016-7026</dc:identifier><dc:identifier>10.11591/ijece.v13i6.pp7016-7026</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 13 No 6 (2023); 7016</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/32610/17027</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>