Akses terbuka
Jurnal
SINTA 1
Random-guided optimizer: a metaheuristic that shifts random search to guided search through iteration
Bulletin of Electrical Engineering and Informatics · Vol. 13 No. 4 (2024) · hlm. 2668–2676
ISSN 2089-3191, 2302-9285
Terbit 2024-06-01
Penerbit Institute of Advanced Engineering and Science (IAES)
Bahasa en
Abstrak
This study offers a new swarm-based metaheuristic: random-guided optimizer (RGO). RGO has novel mechanics in shifting the random motion into a guided motion strategy during the iteration. In RGO, the iteration is divided into three equal size phases. In the first phase, the unit walks randomly inside the search space to tackle the local optimal problem earlier. In the second phase, each unit uses a unit selected randomly among the population as a reference in conducting the guided motion. In the third phase, each unit conducts guided motion toward or surpasses the best unit. Through simulation, RGO successfully finds the acceptable solution for 23 benchmark functions. Moreover, RGO successfully finds the global optimal solution for four functions: Branin, Goldstein-Price, Six Hump Camel, and Schwefel 2.22. RGO also outperforms slime mold algorithm (SMA), pelican optimization algorithm (POA), golden search optimizer (GSO), and northern goshawk optimizer (NGO) in solving 12, 20, 12, and 1 function consecutively. In the future, improvement can be made by transforming RGO into solid multiple-phase strategy without losing its identity as a metaheuristic with multiple strategy in every iteration.
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
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">Random-guided optimizer: a metaheuristic that shifts random search to guided search through iteration</dc:title><dc:creator>Purba Daru Kusuma</dc:creator><dc:creator>Faisal Candrasyah Hasibuan</dc:creator><dc:subject>swarm intelligence</dc:subject><dc:subject>metaheuristic optimization</dc:subject><dc:subject>random search</dc:subject><dc:subject>guided search</dc:subject><dc:subject>benchmark functions</dc:subject><dc:subject>global optimization</dc:subject><dc:subject>pelican optimization algorithm</dc:subject><dc:description xml:lang="en">This study offers a new swarm-based metaheuristic: random-guided optimizer (RGO). RGO has novel mechanics in shifting the random motion into a guided motion strategy during the iteration. In RGO, the iteration is divided into three equal size phases. In the first phase, the unit walks randomly inside the search space to tackle the local optimal problem earlier. In the second phase, each unit uses a unit selected randomly among the population as a reference in conducting the guided motion. In the third phase, each unit conducts guided motion toward or surpasses the best unit. Through simulation, RGO successfully finds the acceptable solution for 23 benchmark functions. Moreover, RGO successfully finds the global optimal solution for four functions: Branin, Goldstein-Price, Six Hump Camel, and Schwefel 2.22. RGO also outperforms slime mold algorithm (SMA), pelican optimization algorithm (POA), golden search optimizer (GSO), and northern goshawk optimizer (NGO) in solving 12, 20, 12, and 1 function consecutively. In the future, improvement can be made by transforming RGO into solid multiple-phase strategy without losing its identity as a metaheuristic with multiple strategy in every iteration.</dc:description><dc:publisher>Institute of Advanced Engineering and Science (IAES)</dc:publisher><dc:date>2024-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/eei.v13i4.6507</dc:identifier><dc:identifier>10.11591/eei.v13i4.6507</dc:identifier><dc:source>Bulletin of Electrical Engineering and Informatics; Vol 13 No 4 (2024); 2668-2676</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/6507/3811</dc:relation><dc:rights>https://creativecommons.org/licenses/by-sa/4.0/</dc:rights></oai_dc:dc>
Sitasi dan pengindeksan
OpenAlex
Terindeks
lewat ID karya OpenAlex (record dari sumber OpenAlex)
0 sitasi
Crossref
Belum diperiksa
Jumlah menurut tiap indeks pada 19 Nov 2026; setiap indeks menghitung sitasi dengan cara berbeda.
OpenAlex juga mencatat karya ini di: crossref.
Sitasi artikel ini
APA 7
Kusuma, P. D., & Hasibuan, F. C. (2024). Random-guided optimizer: a metaheuristic that shifts random search to guided search through iteration. Bulletin of Electrical Engineering and Informatics, 13(4), 2668–2676. https://doi.org/10.11591/eei.v13i4.6507
Salin
IEEE
P. D. Kusuma and F. C. Hasibuan, “Random-guided optimizer: a metaheuristic that shifts random search to guided search through iteration,” Bulletin of Electrical Engineering and Informatics, vol. 13, no. 4, pp. 2668–2676, 2024, doi: 10.11591/eei.v13i4.6507.
Salin
Dibuat dari metadata jurnal; periksa nama penulis sebelum dipakai.