Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Recent research in finding the optimal path by ant colony optimization

Bulletin of Electrical Engineering and Informatics · Vol. 10 No. 2 (2021) · hlm. 1015–1023

DOI
10.11591/eei.v10i2.2690
ISSN
2089-3191, 2302-9285
Terbit
2021-03-16
Penerbit
Institute of Advanced Engineering and Science (IAES)
Bahasa
en
Lisensi
creativecommons.org/licenses/by-sa/4.0/

Abstrak

The computation of the optimal path is one of the critical problems in graph theory. It has been utilized in various practical ranges of real world applications including image processing, file carving and classification problem. Numerous techniques have been proposed in finding optimal path solutions including using ant colony optimization (ACO). This is a nature-inspired metaheuristic algorithm, which is inspired by the foraging behavior of ants in nature. Thus, this paper study the improvement made by many researchers on ACO in finding optimal path solution. Finally, this paper also identifies the recent trends and explores potential future research directions in file carving.

Kata kunci

Jaringan kolaborasi para penulis

16 penulis · 52 tautan kepenulisan bersama · 46 lintas organisasi

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

  • Tun Hussein Onn University of Malaysia
  • University of Technology Malaysia
  • University of Basrah
  • Saudi Electronic University
  • Universitas Putera Batam
  • Shatt Al-Arab University College
  • University of Malaya
  • Organisasi lain
  • 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
Murtaja Ali SaareUniversity of Basrah3
Saima Anwar LashariSaudi Electronic University2
Andi MaslanUniversitas Putera Batam1
Feresa Binti Mohd FoozyTun Hussein Onn University of Malaysia1
Ali K. MattarShatt Al-Arab University College1
Seng Yue WongUniversity of Malaya1
Ali Abdulateef AbdulbariUniversity of Technology Malaysia1
Yaqdhan Mahmood HusseinAl-Furat Al-Awsat Technical University1
Hatem Oday HanooshAl-Muthanna University1
Mustafa Mohammed JawadUniversity of Technology Malaysia1
Sarosh AhmadGovernment College University, Lahore1
Yaser KhalillUniversity of Technology Malaysia1
Alia Ahmed MahdiDirectorate of Health1
Norhamreeza Abdul HamidTun Hussein Onn University of Malaysia1

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">Recent research in finding the optimal path by ant colony optimization</dc:title><dc:creator>Sari Ali Sari</dc:creator><dc:creator>Kamaruddin Malik Mohamad</dc:creator><dc:subject>ant colony optimization</dc:subject><dc:subject>optimal path finding</dc:subject><dc:subject>shortest path</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>metaheuristic algorithms</dc:subject><dc:subject>bio-inspired algorithms</dc:subject><dc:subject>file carving</dc:subject><dc:subject>image processing</dc:subject><dc:subject>classification</dc:subject><dc:description xml:lang="en">The computation of the optimal path is one of the critical problems in graph theory. It has been utilized in various practical ranges of real world applications including image processing, file carving and classification problem. Numerous techniques have been proposed in finding optimal path solutions including using ant colony optimization (ACO). This is a nature-inspired metaheuristic algorithm, which is inspired by the foraging behavior of ants in nature. Thus, this paper study the improvement made by many researchers on ACO in finding optimal path solution. Finally, this paper also identifies the recent trends and explores potential future research directions in file carving.</dc:description><dc:publisher>Institute of Advanced Engineering and Science (IAES)</dc:publisher><dc:date>2021-03-16</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.v10i2.2690</dc:identifier><dc:identifier>10.11591/eei.v10i2.2690</dc:identifier><dc:source>Bulletin of Electrical Engineering and Informatics; Vol 10 No 2 (2021); 1015-1023</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/2690/2087</dc:relation><dc:rights>https://creativecommons.org/licenses/by-sa/4.0/</dc:rights></oai_dc:dc>