Main Article Content

Abstract

Samarang is one of the subdistricts in the Garut Regency with the most tourism potential. According to 2021 data from Garut Statistics Indonesia, the tourism potential in the Samarang included nature tourism, cultural tourism, special interest tourism, and artificial tourism. Nature tourism had the highest proportion of approximately 49.15% compared to other tourism. Still, there is limited access to these tourist sites due to considerable distance, damaged road conditions, and remoteness from settlements. This research aims to determine the optimal route, cost, and travel time to access the tourist location. Based on this, the methods used were graph theory and network analysis methods. The distance determination was done using Google Maps and quantitative analysis. The results showed that the shortest distance to access tourist sites in the Samarang from the center of Garut city was about 15.55 km, required the cost of IDR132,000, and travel duration of 52 minutes. At the same time, the results of the network analysis method revealed that the normal route was around 21.35 km, which cost IDR158,000 and required a travel time of 66 minutes.

Keywords

Tourist Graph theory Network analysis

Article Details

How to Cite
Dewi Rahmawati, Marsela Putri, Rosmawati, & Farhanul Hakim. (2023). Analysis of the Fastest Cost and Route Using the Graph Theory and Network Analysis. Enthusiastic : International Journal of Applied Statistics and Data Science, 3(2), 202–211. https://doi.org/10.20885/enthusiastic.vol3.iss2.art7

References

  1. R. Paryanti and A. Thobirin, “Penerapan Teori Graf untuk Mencari Lintasan Tercepat Bus Trans-Jogja,” Undergraduate thesis, Universitas Ahmad Dahlan, Umbulharjo, Yogyakarta, 2019.
  2. U.M. Rifanti and B. Arifwidodo, “Implementasi Algoritma Floyd dalam Penentuan Rute Terpendek,” Jurnal Ilmiah Teknologi Sistem Informasi, vol. 5, no. 2, pp. 140–151, Jul. 2019, doi: 10.26594/register.v5i2.1683.
  3. F.D. Putra, “Implementasi Teori Graf Sistem Angkutan Kendaraan Umum di Kota Medan,” Undergraduate thesis, UIN Sumatera Utara, Seli Serdang, Sumatera Utara, 2021.
  4. E.T. Susdarwono, “Pemrograman Dinamis: Analisis Jaringan Menggunakan PERT dan Prosedur AHP dalam Menyelesaikan Masalah Ekonomi Pertahanan,” Jurnal El-Hamra, 5, no. 1, pp. 1–9, Feb. 2020.
  5. A. Kuntarto and T.H. Purwanto, “Penggunaan Analisa Jaringan Sistem Informasi Geografis Untuk Perencanaan Rute Wisata di Kabupaten Sleman,” Jurnal Bumi Indonesia, vol. 1, no. 2, pp. pp. 140–148, 2012.
  6. Y.P. Hutapea, C.E.J.C. Montolalu, and H.A.H. Komalig, “Dijkstra Algorithm for Determination of the Shortest Trajectory in the Case of Seven Hotels in Manado City Towards Sam Ratulangi Manado Airport,” dCJMA, vol. 9, no. 2, pp. 158–163, Jan. 2021, doi: 10.35799/dc.9.2.2020.29146.
  7. C. Basir, “Pola Graf pada Arus Lalu Lintas Perempatan Srengseng Kembangan Jakarta Barat,” STATMAT, vol. 2, no. 1, pp. 57–65, Jan. 2020, doi: 10.32493/sm.v2i1.4284.
  8. I.S. Putri and B.P. Rahayu, “Basis dan Dimensi Atas pada Graf Pembagi Nol dari Ring Komutatif,” Jurnal Matematika dan Sains (JMS), vol. 2, no. 1, pp. 151–164, Feb. 2022, doi: 10.552273/jms.v2i1.164.