IMPLEMENTASI ALGORITMA A STAR DALAM PENCARIAN RUTE TERPENDEK (SHORTEST PATH PROBLEM) PADA SISTEM PENCARIAN KANTOR POS DI KOTA PEKANBARU
DOI:
https://doi.org/10.37859/seis.v2i1.3313
Abstract
With the advancement of information technology today, there are several solutions that can facilitate the search for the shortest path (Shortest Path Problem) by using various algorithms such as the djiktra algorithm, A star algorithm, floyd warshall algorithm, prim algorithm and others. Algorithm A* (A star) is one of the algorithms included in the category of search methods that have information (informed search method). This algorithm is very good as a solution to the path finding process where this algorithm looks for the distance of the fastest route that will be taken by an initial point (starting point) to the destination object. The search technique used in this simulation is using the A* Algorithm with the manhattan distance heuristic function. Path Finding is one of the most important materials in Artificial Intelligence. Path Finding is usually used to solve problems on a graph. This study aims to provide a solution in finding the shortest route, so as to reduce operational costs that must be incurred by the company and also with this new system, it can be known the distance from one point to another without using manual calculations.
Downloads
References
[2] Rusydi Umar1, Anton Yudhana2, Andi Prayudi. 2021. “Analisis Perbandingan Algoritma Djikstra, A-Star, Dan Floyd Warshall Dalam Pencarian Rute Terdekat Pada Objek Wisata Kabupaten Dompu.” Jurnal Teknologi Informasi dan Ilmu Komputer (JTIIK) 8(2):227–34.
[3] Syukriah, Yenie, Falahah, dan Hermi Solihin. 2016. “Penerapan Algoritma A* (Star) Untuk Mencari Rute Tercepat Dengan Hambatan.” Seminar Nasional Telekomunikasi dan Informatika (SELISIK) (Selisik):219–24.
[4] Mahmud Basuki, Hermanto MZ, Selvia Aprilyanti, Muhammad Junaidi. 2019. “Perancangan Sistem Keseimbangan Lintasan Produksi Dengan Pendekatan Metode Heuristik.” Jurnal Teknologi (July).
[5] Kiki Setiawan, Supriyadin, Imam Santoso, Roy Buana. 2018. “Menghitung Rute Terpendek Menggunakan Algoritma a * Dengan Fungsi Euclidean Distance.” Seminar Nasional Teknologi Informasi dan Komunikasi 2018 2018(ISSN: 2089-9815):70–79.
[6] Ramadhan, Zuhri, Muhammad Zarlis, Syahril Efendi, Andysah Putera, dan Utama Siahaan. 2018. “Perbandingan Algoritma Prim Dengan Algoritma Floyd-Warshall Dalam Menentukan Rute Terpendek ( Shortest Path Problem ).” Jurnal Riset Komputer (JURIKOM) 5(2):136–39.
[7] Dalem, Ida Bagus Gede Wahyu Antara. 2018. “Penerapan Algoritma A* (Star) Menggunakan Graph Untuk Menghitung Jarak Terpendek.” JURNAL RESISTOR 1(1):41–47.
Downloads
Published
How to Cite
Issue
Section
License
Copyright Notice
An author who publishes in the Journal of Software Engineering and Information System (SEIS) agrees to the following terms:
- Author retains the copyright and grants the journal the right of first publication of the work simultaneously licensed under the Creative Commons Attribution-ShareAlike 4.0 License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal
- Author is able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book) with the acknowledgement of its initial publication in this journal.
- Author is permitted and encouraged to post his/her work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of the published work (See The Effect of Open Access).
Read more about the Creative Commons Attribution-ShareAlike 4.0 Licence here: https://creativecommons.org/licenses/by-sa/4.0/.
