A DIJKSTRA ALGORITHM IMPLEMENTATION IN DETERMINING SHORTEST ROUTE TO MOSQUE IN RESIDENTIAL CITRA INDAH CITY

Penerapan Algoritma Dijkstra Dalam Penentuan Rute Terpendek Menuju Masjid Di Perumahan Citra Indah City

  • Siti Lestari Lestari (1*) STMIK Nusa Mandiri
  • Ardiansyah Ardiansyah (2) STMIK Nusa Mandiri Jakarta, Indonesia
  • Angelina Puput Giovani (3) STMIK Nusa Mandiri Jakarta, Indonesia
  • Desy Dwijayanti (4) STMIK Nusa Mandiri Jakarta, Indonesia

  • (*) Corresponding Author
Keywords: Algoritma Dijkstra, Rute Terpendek, Shortest Route

Abstract

The application of artificial intelligence (Artificial Intelligence) for problem-solving in the field of computer science has experienced rapid development from year to year as the development of artificial intelligence itself. Problems involving searching (searching) is one example of the use of artificial intelligence that is quite popular to solve various kinds of problems. In daily activities, the use of roads is always an unavoidable activity, so determining the shortest path from one point to another becomes a problem that is often encountered. This is also felt by residents who live in a large enough housing. Sometimes to be able to reach the destination they are often confused in deciding which way to go to get the shortest distance to the destination. Citra Indah City Housing is a residential area in the Jonggol District area, Bogor Regency, developed by the Ciputra group. Within the Vignolia Hill Cluster, there is a mosque located on the northwest corner of the Vignolia Hill cluster or at the western end of the AH.17 block. A large number of blocks raise problems regarding the shortest route that can be taken by residents to get to the mosque. So, the purpose of this research is to determine the shortest path taken by citizens to get to the mosque. The method used is to apply the Djikstra algorithm which is able to produce the shortest route for residents to get to the mosque.

Downloads

Download data is not yet available.

References

Amaliah, B., Fatichah, C., & Riptianingdyah, O. (2016). FINDING THE SHORTEST PATHS AMONG CITIES IN JAVA ISLAND USING NODE COMBINATION BASED ON DJIKSTRA ALGORITHM. International Journal on Smart Sensing and Intelligent Systems, 9(4), 2219–2236.

Ardana, D., & Saputra, R. (2016). Penerapan Algoritma Dijkstra pada Aplikasi Pencarian Rute Bus Trans Semarang. Snik, 299–306.

Budihartono, E. (2016). PENERAPAN ALGORITMA DIJKSTRA UNTUK SISTEM PENDUKUNG KEPUTUSAN BAGI PENENTUAN JALUR TERPENDEK PENGIRIMAN PAKET BARANG PADA TRAVEL. SENIT, 69–78.

Gusmão, A., Pramono, S. H., & Sunaryo. (2013). Sistem Informasi Geografis Pariwisata Berbasis Web Dan Pencarian Jalur Terpendek Dengan Algoritma Dijkstra. Jurnal EECCIS, 7(2), 125–130. https://jurnaleeccis.ub.ac.id/index.php/eeccis/article/view/214

Hannats, M., Ichsan, H., Yudaningtyas, E., & Muslim, M. A. (2012). Solusi Optimal Pencarian Jalur Tercepat dengan Algoritma Hybrid Fuzzy-Dijkstra. Jurnal EECCIS, 6(2), 155–160. https://jurnaleeccis.ub.ac.id/index.php/eeccis/article/view/185

Hutapea, M. I. (2013). IMPLEMENTASI ALGORITMA GREEDY UNTUK MENCARI RUTE TERPENDEK ANTAR KOTA. MAJALAH ILMIAH METHODA, 3(3), 23–30. http://www.ojs.lppmmethodistmedan.net/index.php/METHODA/article/view/68

Kirono, S., Arifianto, M. I., Putra, R. E., & Musoleh, A. (2018). GRAPH-BASED MODELING AND DIJKSTRA ALGORITHM FOR SEARCHING VEHICLE ROUTES ON HIGHWAYS. International Journal of Mechanical Engineering and Technology (IJMET), 9(8), 1273–1280.

Lestari, S., Ardiansyah, Giovani, A. P., & Jayanti, D. D. (2020). Independent Research Final Report.

Mardlootillah, H. I., Suyitno, A., & Arini, F. Y. (2015). SIMULASI ALGORITMA DIJKSTRA DALAM MENANGANI MASALAH LINTASAN TERPENDEK PADA GRAF MENGGUNAKAN VISUAL BASIC. Unnes Journal of Mathematics, 4(2), 91–96. https://journal.unnes.ac.id/sju/index.php/ujm/article/view/9349

Nggufron, N., Rochmad, R., & Mashuri, M. (2019). Pencarian Rute Terbaik Pemadam Kebakaran Kota Semarang Menggunakan Algoritma Dijkstra dengan Logika Fuzzy sebagai Penentu Bobot pada Graf. Unnes Journal of Mathematics, 8(1), 40–49. https://journal.unnes.ac.id/sju/index.php/ujm/article/view/19461/

Primadasa, Y. (2015). PENCARIAN RUTE TERPENDEK MENGGUNAKAN ALGORITMA DIJKSTRA PADA SIG BERBASIS WEB UNTUK DISTRIBUSI MINUMAN (STUDI KASUS PT. COCA-COLA KOTA PADANG. Jurnal KomTekInfo Fakultas Ilmu Komputer, 2(2), 47–54.

Pugas, D. O., Somantri, M., Satoto, K. I., & Nilsson, N. (2011). Pencarian Rute Terpendek Menggunakan Algoritma Dijkstra dan Astar ( A *) pada SIG Berbasis Web untuk Pemetaan Pariwisata Kota Sawahlunto. 13(1), 27–32.

Rifanti, U. M. (2017). PEMILIHAN RUTE TERBAIK MENGGUNAKAN ALGORITMA DIJKSTRA UNTUK MENGURANGI KEMACETAN LALU LINTAS DI PURWOKERTO. Jurnal Matematika Dan Pendidikan Matematika, 2(2), 90–99.

Published
2020-03-15
How to Cite
Lestari, S., Ardiansyah, A., Giovani, A., & Dwijayanti, D. (2020). A DIJKSTRA ALGORITHM IMPLEMENTATION IN DETERMINING SHORTEST ROUTE TO MOSQUE IN RESIDENTIAL CITRA INDAH CITY. Jurnal Pilar Nusa Mandiri, 16(1), 65-70. https://doi.org/10.33480/pilar.v16i1.1199
Article Metrics

Abstract viewed = 77 times
PDF downloaded = 46 times