Penerapan Algoritma Dijkstra dengan metode SAW dan Haversine Pada Pencarian Rute Terdekat Menemukan Titik Pemberhentian Angkot Kota Sukabumi
-
Zaldi Arif Mulkan
*
Universitas Muhammadiyah, Sukabumi,
Indonesia
- Iwan Rizal Setiawan Universitas Muhammadiyah, Sukabumi, Indonesia
- Fathia Frazna Universitas Muhammadiyah, Sukabumi, Indonesia (*) Corresponding Author
Abstract
Angkot (City Transportation) in Sukabumi City is a popular public transportation system and is one of the main means of transportation for local residents and visitors to move around in the city with so many lanes each that the angkot itself passes, 19 route routes which cause so many problems for the community and outsiders of Sukabumi in finding angkot stop points so that it slows down time and is inefficient. Therefore, to make it easier to find angkot stopping points, Dijkstra's algorithm was chosen. Dijkstra's algorithm is the shortest route search algorithm by relying on the smallest value weight and calculating all neighboring nodes to find the smallest value. Researchers used 2 methods used, namely the SAW and Haversine methods. SAW method (Simple Additive Weighting Method). This method is for carrying out weighted sums based on 3 criteria for road width, distance traveled and estimated time and then normalizing the data to ranking. the haversine method is to calculate distances based on lattitude and lontitude. Initiate from the starting point to the destination point with a graph using Dijkstra's algorithm to produce a 30 iteration focus point generated by Dijkstra's algorithm, then evaluate the model by reaching other paths to the destination point.The results obtained in the search for the closest route using the two SAW and Haversine methods, after calculating all the paths passed from the starting point V117 (Bayangkara Street) - V82 (R.E Martadinata Street) obtained the results of the shortest route obtained, namely V117 - V118 - V131 - V130 - V132 - V133 - V134 - V138 - V137 - V110 - V82. Looking for the closest route from the starting point to the destination location determined by the researcher with the final result in the form of a Web-based application.
Downloads
References
P. M. Kemenhub, “PERATURAN MENTERI PERHUBUNGAN REPUBLIK INDONESIA NOMOR PM 15 TAHUN 2019.” 2019.
M. Ogotan, “EFEKTIVITAS PEMBERIAN IZIN TRAYEK ANGKUTAN UMUM ( STUDY DI DINAS PERHUBUNGAN KOTA MANADO ) Friedrick Napoleon Lapian Patar Rumapea PENDAHULUAN Transportasi atau pengangkutan merupakan bidang kegiatan yang sangat penting beberapa dalam kehidupan masyarakat”.
Y. H. Nuryoso, Pradjoko, and Lelah, “Penerapan Algoritma A* pada Pencarian Rute Terpendek pada Rute Angkot Di Kota Sukabumi,” J. Sarj. Tek. Inform. Vol. 8, No. 1, Februari 2020, pp. 21-35 e-ISSN, vol. 8, no. 1, pp. 21–35, 2020.
Badan Pengembangan Kawasan Perkotaan, “Profil Kota Sukabumi,” https://portal.sukabumikota.go.id/, 2017. https://portal.sukabumikota.go.id/
Peraturan Menteri Perhubungan Republik Indonesia, “Peraturan Menteri Perhubungan Republik Indonesia Nomor PM 15 Tahun 2019 Tentang Penyelenggaraan Angkutan Orang Dengan Kendaraan Bermotor Umum Dalam Trayek,” PM 15 Tahun 2019, p. 13, 2019, [Online]. Available: http://jdih.dephub.go.id/assets/uudocs/permen/2015/PM_180_Tahun_2015.pdf
A. Aji, “Optimasi Jalur Tercepat Degan Menggunakan Modifikasi Algoritma Bellman Fors (Studi Kasus Lintas Antar Kecamatan Kota Malang),” J. EECCIS, vol. 9, no. 2, pp. 168–172, 2015.
E. S. Arga, G. G. Firmansyah, K. Imam, and M. Fauzi, “Penerapan algoritma djikstra pada pencarian jalur terpendek,” vol. 1, no. 2, pp. 134–142, 2021.
T. A. Labibah, “Pencarian Rute Trayek Angkot Terpendek Menggunakan Metode Algoritma Dijkstra Dan Haversine Formula,” FIKI(Jurnal Teknol. Inf. dan Komunikasi), vol. VIII, no. 2, pp. 128–134, 2018.
Umar et al., “Wisata Kabupaten Dompu Comparative Analysis of Djikstra , a-Star , and Floyd Warshall Algorithm in Searching the Nearest Route Search To Tourism,” vol. 8, no. 2, pp. 227–234, 2021, doi: 10.25126/jtiik.202182866.
E. Marbun and S. Hansun, “Sistem Pendukung Keputusan Pemilihan Program Studi Dengan Metode Saw Dan Ahp,” Ilk. J. Ilm., vol. 11, no. 3, pp. 175–183, 2019, doi: 10.33096/ilkom.v11i3.432.175-183.
D. O. Sihombing, W. Nugraha, and F. Andani, “Aplikasi Pengelolaan Data Order Mkios Berbasis Web Pada TDC PT . Telesindo Shop Pontianak,” Simp. Nas. Ilmu Pengetah. dan Teknol. 2016, vol. Vol.1, no. 1, pp. 129–138, 2016.
D. G. Monica, “Dea Gratyas Monica NIM. 171414070,” 2021.
M. Arizal Fahribi Cahyo, “Sistem Pencarian Jarak Terdekat menggunakan Metode Haversine Berbasis Android,” Ekon. Akuntasi, vol. 01, no. 08, pp. 1–13, 2017.
H. Anra, “Sistem Informasi Geografis Perumahan dan Fasilitas Sosial Terdekat dengan Metode Haversine Formula,” J. Sist. dan Teknol. Inf., vol. 1, no. 1, pp. 1–6, 2016.
T. Rangga, G. Erwin, and M. Yana, “Perancangan Sistem Evakuasi Tsunami Dengan Metode Clustering Dan Algoritma Dijkstra Berbasis Android,” 2020, [Online]. Available: http://repository.nusaputra.ac.id/id/eprint/60/%0Ahttp://repository.nusaputra.ac.id/id/eprint/60/1/Rangga Turnadi_Erwin Gunawan_Yana Mulia_TI20.pdf.
S. Pratama, “Perbandingan Algoritma Dijkstra dan Algoritma Floyd Warshall Pada Pencarian Rute Pariwisata di Kota Palembang,” Sriwij. Univ. Repos., 2018, [Online]. Available: http://repository.unsri.ac.id/id/eprint/10013.
Menteri Perhubungan RI, “Peraturan Menteri Perhubungan Republik Indonesia Nomor PM 15 Tahun 2019 Tentang Penyelenggaraan Angkutan Orang Dengan Kendaraan Bermotor Umum Dalam Trayek,” PM 15 Tahun 2019, p. 13, 2019.
R. A. D. Novandi, “Perbandingan Algoritma Dijkstra dan Algoritma Floyd-Warshall dalam Penentuan Lintasan Terpendek ( Single Pair Shortest Path ),” IF2251 Strateg. Algoritm., vol. 1, pp. 1–5, 2013.
D. Yogaswara and S. Suhartono, “Perbandingan Algoritma A-Star dan Dijkstra pada Pencarian Jalur Evakuasi Tsunami Terpendek Menuju Shelter di Kabupaten Bantul Berbasis Aplikasi Android,” J. Masy. Inform., vol. 12, no. 1, pp. 10–18, 2021, doi: 10.14710/jmasif.12.1.41018.
R. Paryanti and A. Thobirin, “Penerapan Teori Graf untuk Mencari Lintasan Tercepat Bus Trans-Jogja(Rosyana Paryanti) Penerapan Teori Graf untuk Mencari Lintasan Tercepat Bus Trans-Jogja,” Univ. Ahmad Dahlan, pp. 1–9, 2011.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Penerapan Algoritma Dijkstra dengan metode SAW dan Haversine Pada Pencarian Rute Terdekat Menemukan Titik Pemberhentian Angkot Kota Sukabumi
Pages: 1205-1218
Copyright (c) 2023 Zaldi Arif Mulkan, Iwan Rizal Setiawan, Fathia Frazna
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).
