Implementasi Algoritma Greedy dan Algoritma A* Untuk Penentuan Cost Pada Routing Jaringan
DOI:
https://doi.org/10.30865/klik.v3i2.576Keywords:
Greedy Algorithm; A* Algorithm; Network; Routing ProtocolAbstract
The current increase in internet development raises new problems in terms of path optimization on the internet. This makes network path optimization a major problem in choosing the shortest route. The purpose of this research is to understand and compare the process of finding the shortest route using two algorithms, namely Greedy and A*. The A* algorithm has an advantage in overcoming network workloads compared to the Greedy algorithm. In implementation, both algorithms have the same results in determining the delivery path. However, the A* algorithm is more effective for use on large and complex networks because it has more certain and accurate calculations. From the test results, it was found that the A* algorithm has better performance than the greedy algorithm in the test. Where the final cost value of the greedy algorithm is 49, while for the A* algorithm is 48
Downloads
References
M. P. M. Routing, F. S. Mukti, A. Basuki, and O. Setyawati, “Pengendalian Kemacetan Jaringan,” J. EECCIS, vol. 12, no. 1, pp. 15–19, 2018.
L. S. Moonlight and S. Suhardi, “Pengaruh Model Jaringan Terhadap Optimasi Routing Open Shortest Path First (Ospf),” Teknologi, vol. 1, no. 2, pp. 68–80, 2012, doi: 10.26594/teknologi.v1i2.56.
S. D. Riskiono and D. Darwis, “Peran Load Balancing Dalam Meningkatkan Kinerja Web Server Di Lingkungan Cloud,” Krea-TIF, vol. 8, no. 2, p. 1, 2020, doi: 10.32832/kreatif.v8i2.3503.
R. D. Gunawan, R. Napianto, R. I. Borman, and I. Hanifah, “Penerapan Pengembangan Sistem Extreme Programming Pada Aplikasi Pencarian Dokter Spesialis di Bandarlampung Berbasis Android,” Format J. Ilm. Tek. Inform., vol. 8, no. 2, p. 148, 2020, doi: 10.22441/format.2019.v8.i2.008.
N. N. Sania and I. Sari, “Implementasi Rencana Perjalanan Wisata di Kota Bogar Menggunakan Algoritma Greedy Berbasis Website,” J. Ilm. Teknol. dan Rekayasa, vol. 24, no. 2, pp. 114–130, 2019.
M. Z. Usman and T. Oktiarso, “Implementasi Algoritma Greedy untuk Menyelesaikan Travelling Salesman Problem di Distributor PT. Z,” J. Integr. Syst., vol. 1, no. 2, pp. 216–229, 2018.
A. Hermawan and A. S. Tiwa, “Penerapan Algoritma A-Star untuk Pencarian Tempat Kuliner di Kota Tangerang,” J. Sist. dan Inform., vol. 15, no. 2, pp. 104–114, 2021, doi: 10.30864/jsi.v15i2.335.
Y. Darnita and R. Toyib, “Penerapan Algoritma Greedy Dalam Pencarian Jalur Terpendek Pada Instansi-Instasi Penting Di Kota Argamakmur Kabupaten Bengkulu Utara,” J. Media Infotama, vol. 15, no. 2, 2019, doi: 10.37676/jmi.v15i2.867.
F. Nova Arviantino, W. Gata, L. Kurniawati, Y. A. Setiawan, and D. Priansyah, “Penerapan Algoritma Greedy Dalam Pencarian Jalur Terpendek Pada Masjid–Masjid Di Kota Samarinda,” Metik J., vol. 5, no. 1, pp. 8–11, 2021, doi: 10.47002/metik.v5i1.188.
D. Hermanto and S. Dermawan, “Penerapan Algoritma A-Star Sebagai Pencari Rute Terpendek pada Robot Hexapod,” J. Nas. Tek. Elektro, vol. 7, no. 2, p. 122, 2018, doi: 10.25077/jnte.v7n2.545.2018.
Y. H. Nuryoso, P. Pradjoko, and L. Lelah, “Implementasi Algoritma A-Star Untuk Mencari Rute Terpendek Angkutan Umum Kota (Studi Kasus Pada Rute Angkutan Umum Kota di Kota Sukabumi),” JSTIE (Jurnal Sarj. Tek. Inform., vol. 8, no. 1, p. 21, 2020, doi: 10.12928/jstie.v8i1.13922.
R. I. Borman and B. Priyopradono, “Implementasi Penerjemah Bahasa Isyarat Pada Bahasa Isyarat Indonesia (BISINDO) Dengan Metode Principal Component Analysis (PCA),” J. Inform. J. Pengemb. IT, vol. 03, no. 1, pp. 103–108, 2018.
R. I. Borman and A. Ansori, “Implementasi Augmented Reality pada Aplikasi Android Pegenalan Gedung Pemerintahan Kota Bandar Lampung,” J. Teknoinfo, vol. 11, no. 1, pp. 1–5, Jun. 2017, doi: 10.33365/jti.v11i1.2.
I. Ahmad, A. T. Prastowo, E. Suwarni, and R. I. Borman, “Pengembangan Aplikasi Online Delivery Sebagai Upaya Untuk Membantu Peningkatan Pendapatan,” JMM (Jurnal Masy. Mandiri), vol. 5, no. 6, pp. 4–12, 2021.
I. Attamimi, W. Yahya, and M. H. Hanafi, “Analisis Perbandingan Algoritma Floyd-Warshall dan Dijkstra untuk Menentukan Jalur Terpendek Pada Jaringan Openflow,” J. Pengemb. Teknol. Inf. dan Ilmu Komput., vol. 1, no. 12, pp. 1842–1849, 2017.
L. Lukman, R. Hidayat, and M. F. R. Pribadi, “Perbandingan Algoritma A* Dengan Algoritma Greedy Pada Penentuan Routing Jaringan,” CCIT J., vol. 12, no. 2, pp. 158–169, 2019, doi: 10.33050/ccit.v12i2.686.
Y. Mutsaqov, Ativ, Muhammad Fernando and D. A. Megawaty, “Penerapan Algoritma A-Star Pada Aplikasi Pencarian Lokasi Foto Berbasis Android,” Inov. Pembang. J. …, vol. 8, no. 1, pp. 39–52, 2020.
D. Grace, M. S. Tanciga, and Nurdin, “Sistem Informasi Letak Geografis Penentuan Jalur Tercepat Rumah Sakit Di Kota Palu Menggunakan Algoritma Greedy Berbasis Web,” J. Elektron. Sist. Inf. dan Komput., vol. 4, no. 2, pp. 59–76, 2018.
H. Puja Kekal, W. Gata, S. Nurdiani, A. J. Setio Rini, and D. Sely Wita, “Analisa Pencarian Rute Tercepat Menuju Tempat Wisata Pulau Kumala Kota Tenggarong Menggunakan Algoritma Greedy,” J. Ilm. Ilmu Komput., vol. 7, no. 1, pp. 9–15, 2021, doi: 10.35329/jiik.v7i1.179.
M. Furqan, Y. R. Nasution, and T. S. Nurdianti, “Penerapan Algoritma Greedy Untuk Menentukan Rute Terpendek Antar Klinik Gigi,” CSRID (Computer Sci. Res. Its Dev. Journal), vol. 12, no. 3, p. 170, 2021, doi: 10.22303/csrid.12.3.2020.170-178.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Implementasi Algoritma Greedy dan Algoritma A* Untuk Penentuan Cost Pada Routing Jaringan
ARTICLE HISTORY
How to Cite
Issue
Section
Copyright (c) 2023 Ristasari Dwi Septiana, Dimas Abisono Punkastyo, Nurhasan Nugroho
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are 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 an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their 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 published work (Refer to The Effect of Open Access).
