Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

A hybrid technique for single-source shortest path-based on A* algorithm and ant colony optimization

IAES International Journal of Artificial Intelligence · Vol. 9 No. 2 (2020) · hlm. 356–363

DOI
10.11591/ijai.v9.i2.pp356-363
ISSN
2252-8938, 2089-4872
Terbit
2020-06-01
Penerbit
Institute of Advanced Engineering and Science
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

In the single-source shortest path (SSSP) problem, the shortest paths from a source vertex v to all other vertices in a graph should be executed in the best way. A common algorithm to solve the (SSSP) is the A* and Ant colony optimization (ACO). However, the traditional A* is fast but not accurate because it doesn’t calculate all node's distance of the graph. Moreover, it is slow in path computation. In this paper, we propose a new technique that consists of a hybridizing of A* algorithm and ant colony optimization (ACO). This solution depends on applying the optimization on the best path. For justification, the proposed algorithm has been applied to the parking system as a case study to validate the proposed algorithm performance. First, A*algorithm generates the shortest path in fast time processing. ACO will optimize this path and output the best path. The result showed that the proposed solution provides an average decreasing time performance is 13.5%.

Kata kunci

Jaringan kolaborasi para penulis

25 penulis · 68 tautan kepenulisan bersama · 36 lintas organisasi

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

  • Imam Ja’afar Al-Sadiq University
  • Tun Hussein Onn University of Malaysia
  • Universiti Teknikal Malaysia Melaka
  • University of Al Maarif
  • University of Anbar
  • Beijing Institute of Technology
  • Universiti of Malaysia Sabah
  • Organisasi lain
  • 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
Lukman Audah‏Tun Hussein Onn University of Malaysia8
Mohammed Salah AboodBeijing Institute of Technology5
Zahriladha ZakariaUniversiti Teknikal Malaysia Melaka2
Sarmad Nozad MahmoodAfiliasi tidak diketahui2
Salama A. MostafaTun Hussein Onn University of Malaysia2
Mustafa Hamid HassanImam Ja’afar Al-Sadiq University2
Mohammed Ahmed JubairImam Ja’afar Al-Sadiq University2
Herwansyah LagoUniversiti of Malaysia Sabah1
Ahmad AhmadUniversitas Halu Oleo1
Sarah Zaeead AttaallahAfiliasi tidak diketahui1
Haneen Sameer MhmoodAfiliasi tidak diketahui1
Zeena Abdulsattar KhudhurAfiliasi tidak diketahui1
Azzam Amer DhannoonAfiliasi tidak diketahui1
Bassam HasanUniversiti Tenaga Nasional1
Mohammed Ayad SaadNational University of Malaysia1
Tabarak Ali AbdulhusseinImam Ja’afar Al-Sadiq University1
Hamid A. Al-FalahiAfiliasi tidak diketahui1
Drai Ahmed SmaitMashreq University1
Mohammed Sulaiman MustafaAfiliasi tidak diketahui1
Ali Hashim AbbasImam Ja’afar Al-Sadiq University1
Ahmed Jamal AhmedUniversity of Al Maarif1

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: OAI-PMH (metadata jurnal) http://ijai.iaescore.com/index.php/IJAI/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">A hybrid technique for single-source shortest path-based on A* algorithm and ant colony optimization</dc:title>
	<dc:creator>Alani, Sameer</dc:creator>
	<dc:creator>Baseel, Atheer</dc:creator>
	<dc:creator>Maad Hamdi, Mustafa</dc:creator>
	<dc:creator>Abduljabbar Rashid, Sami</dc:creator>
	<dc:subject xml:lang="en-US"></dc:subject>
	<dc:subject xml:lang="en-US">A* algorithm, Ant colony optimization, Parking system, Single-source shortest path</dc:subject>
	<dc:description xml:lang="en-US">In the single-source shortest path (SSSP) problem, the shortest paths from a source vertex v to all other vertices in a graph should be executed in the best way. A common algorithm to solve the (SSSP) is the A* and Ant colony optimization (ACO). However, the traditional A* is fast but not accurate because it doesn’t calculate all node's distance of the graph. Moreover, it is slow in path computation. In this paper, we propose a new technique that consists of a hybridizing of A* algorithm and ant colony optimization (ACO). This solution depends on applying the optimization on the best path. For justification, the proposed algorithm has been applied to the parking system as a case study to validate the proposed algorithm performance. First, A*algorithm generates the shortest path in fast time processing. ACO will optimize this path and output the best path. The result showed that the proposed solution provides an average decreasing time performance is 13.5%.</dc:description>
	<dc:publisher xml:lang="en-US">Institute of Advanced Engineering and Science</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2020-06-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ijai.iaescore.com/index.php/IJAI/article/view/20508</dc:identifier>
	<dc:identifier>10.11591/ijai.v9.i2.pp356-363</dc:identifier>
	<dc:source xml:lang="en-US">IAES International Journal of Artificial Intelligence (IJ-AI); Vol 9, No 2: June 2020; 356-363</dc:source>
	<dc:source>2252-8938</dc:source>
	<dc:source>2089-4872</dc:source>
	<dc:source>10.11591/ijai.v9.i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ijai.iaescore.com/index.php/IJAI/article/view/20508/13343</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2020 Institute of Advanced Engineering and Science</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>