Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Projectile-target search algorithm: a stochastic metaheuristic optimization technique

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 9 No. 5 (2019)

DOI
10.11591/ijece.v9i5.pp3772-3778
ISSN
2722-2578, 2088-8708
Terbit
2019-10-01
Penerbit
Institute of Advanced Engineering and Science
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

This paper proposes a new stochastic metaheuristic optimization algorithm which is based on kinematics of projectile motion and called projectile-target search (PTS) algorithm. The PTS algorithm employs the envelope of projectile trajectory to find the target in the search space. It has 2 types of control parameters. The first type is set to give the possibility of the algorithm to accelerate convergence process, while the other type is set to enhance the possibility to generate new better projectiles for searching process. However, both are responsible to find better fitness values in the search space. In order to perform its capability to deal with global optimum problems, the PTS algorithm is evaluated on six well-known benchmarks and their shifted functions with 100 dimensions. Optimization results have demonstrated that the PTS algoritm offers very good performances and it is very competitive compared to other metaheuristic algorithms

Jaringan kolaborasi para penulis

15 penulis · 40 tautan kepenulisan bersama · 7 lintas organisasi

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

  • Tanjungpura University
  • Universiti Sains Malaysia
  • Universitas Muhammadiyah Sumatera Utara
  • Universiti Malaysia Perlis
  • 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
Ismail YusufTanjungpura University5
Kho Hie KhweeTanjungpura University5
Fitriah HusinAfiliasi tidak diketahui3
F. Trias Pontia WigyariantoTanjungpura University3
Junaidi JunaidiTanjungpura University3
Syaifurrahman SyaifurrahmanTanjungpura University2
Trias Pontia WigyariantoTanjungpura University1
Yohannes M SimanjuntakTanjungpura University1
Mohd HafeezAfiliasi tidak diketahui1
Neilcy Tjahja MooniarsihTanjungpura University1
Syafrudin MasriUniversiti Sains Malaysia1
Muhammad IrwantoUniversiti Malaysia Perlis1
Suwarno SuwarnoUniversitas Muhammadiyah Sumatera Utara1
Fitriah FitriahTanjungpura 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 8 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>Projectile-target search algorithm: a stochastic metaheuristic optimization technique</dc:title><dc:creator>Hiendro, Ayong</dc:creator><dc:description>&lt;jats:p&gt;This paper proposes a new stochastic metaheuristic optimization algorithm which is based on kinematics of projectile motion and called projectile-target search (PTS) algorithm. The PTS algorithm employs the envelope of projectile trajectory to find the target in the search space. It has 2 types of control parameters. The first type is set to give the possibility of the algorithm to accelerate convergence process, while the other type is set to enhance the possibility to generate new better projectiles for searching process. However, both are responsible to find better fitness values in the search space. In order to perform its capability to deal with global optimum problems, the PTS algorithm is evaluated on six well-known benchmarks and their shifted functions with 100 dimensions. Optimization results have demonstrated that the PTS algoritm offers very good performances and it is very competitive compared to other metaheuristic algorithms&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2019-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.v9i5.pp3772-3778</dc:identifier><dc:identifier>10.11591/ijece.v9i5.pp3772-3778</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 9 No 5 (2019); 3772</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/17740/13033</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>