Penerapan Algoritma Dijkstra Untuk Menentukan Rute Terbaik Pada Mobile E-Parking Berbasis Sistem Informasi Geografis

Cahyo Prianto, Muh Kusnadi


Lack of information about the posision of a place and find the best route to get to a destination is complicated, especially looking for a route in finding a parking space. Unavailability of applications that provide information and navigate parking users to find the best route in realtime is a problem that must be answered. Dijkstra's algorithm is one method of solving problems in finding the best route. The Dijkstra algorithm has compared the possible routes to be traversed and calculated every possible distance. The route with the shortest distance would be the best choice This application was built using an Android-based Geographic Information System that utilizes the Google Maps feature as a parking user interface service. This study uses the Java programming language with Android Studio as an IDE (Integrated Development Environment) and the prototyping model is used in developing problem solving and using UML (Unified Modeling Language) as a system design tool. The results that have been achieved from this research is that Dijkstra's algorithm can answer the problem faced by providing the best route navigation from the user's location to the parking lot at the destination

Full Text:


S. Greco, C. Molinaro, and C. Pulice, “Efficient maintenance of shortest distances in dynamic graphs,” IEEE Transactions on Knowledge and Data Engineering, vol. 30, no. 3, pp. 474–487, 2018.

Y. Wang, X. Li, and R. Ruiz, “An exact algorithm for the shortest path problem with position-based learning effects,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. 47, no. 11, pp. 3037–3049, 2017.

S. Bhattacharjee, P. Mitra, and S. K. Ghosh, “Spatial interpolation to predict missing attributes in gis using semantic kriging,” IEEE Transactions on Geoscience and Remote Sensing, vol. 52, no. 8, pp. 4771–4780, 2014.

S. Ye, D. Zhu, X. Yao, N. Zhang, S. Fang, and L. Li, “Development of a highly flexible mobile gis-based system for collecting arable land quality data,” IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, vol. 7, no. 11, pp. 4432–4441, 2014.

S. Zhu and D. Levinson, “Do people use the shortest path? an empirical test of wardrop’s first principle,” PloS one, vol. 10, no. 8, p. e0134322, 2015.

S. Trilles, O. Belmonte, L. D´ıaz, and J. Huerta, “Mobile access to sensor networks by using gis standards and restful services,” IEEE Sensors Journal, vol. 14, no. 12, pp. 4143–4153, 2014.

K. J. Kearfott, Z. D. Whetstone, and K. M. Rafique Mir, “Use of a geographic information system (gis) for targeting radon screening programs in south dakota,” Journal of radiation research, vol. 57, no. 1, pp. 84–90, 2015.

C. Zinoune, P. Bonnifait, and J. Iba˜nez-Guzm´an, “Sequential fdia for autonomous integrity monitoring of navigation maps on board vehicles,” IEEE Transactions on Intelligent Transportation Systems, vol. 17, no. 1, pp. 143–155, 2016.

A. B. Marlintha, W. Java, B. Irawan, W. Java, R. Latuconsina, and W. Java, “Design and implementation of smart village mapping geographic information system based web in the cinunuk village,” pp. 66–71, 2017.

O. Lumasuge, “Implementation Analytic Network Process Method and Geographic Information System To Determine The Freswater Fish Farming Location,” pp. 107–112, 2017.

S. Adi and J. Suhartono, “Smart Village Geographic Information System ( GIS ) Development In Indonesia And Its Analogous Approaches,” no. November, pp. 65–70, 2017.

Z. Cao, H. Guo, J. Zhang, D. Niyato, and U. Fastenrath, “Finding the shortest path in stochastic vehicle routing: A cardinality minimization approach,” IEEE Transactions on Intelligent Transportation Systems, vol. 17, no. 6, pp. 1688–1702, 2016.

S. Ma, K. Feng, J. Li, H. Wang, G. Cong, and J. Huai, “Proxies for shortest path and distance queries,” IEEE Transactions on Knowledge and Data Engineering, vol. 28, no. 7, pp. 1835–1850, 2016.

Y. Zhang, Y. Su, J. Yang, J. Ponce, and H. Kong, “When dijkstra meets vanishing point: a stereo vision approach for road detection,” IEEE Transactions on Pattern Analysis and Machine Intelligence, pp. 1–12, 2018.

J.-d. Zhang, Y.-j. Feng, F.-f. Shi, G. Wang, B. Ma, R.-s. Li, and X.-y. Jia, “Vehicle routing in urban areas based on the oil consumption weight-dijkstra algorithm,” IET Intelligent Transport Systems, vol. 10, no. 7, pp. 495–502, 2016.

A. Sedeno-Noda and A. Raith, “A dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem,” Computers & Operations Research, vol. 57, pp. 83–94, 2015.

O. G. Swathika and S. Hemamalini, “Prims-aided dijkstra algorithm for adaptive protection in microgrids,” IEEE Journal of Emerging and Selected Topics in Power Electronics, vol. 4, no. 4, pp. 1279–1286, 2016.



  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Terindeks oleh :







Program Studi D4 Teknik Informatika
Politeknik Harapan Bersama Tegal
Jl. Mataram No.09 Pesurungan Lor Kota Tegal

Telp. +62283 - 352000

Email :


Copyright: JPIT (Jurnal Informatika: Jurnal Pengembangan IT) p-ISSN: 2477-5126 (print), e-ISSN 2548-9356 (online) 

Flag Counter
View Visitor Statistic


Creative Commons License
JPIT (Jurnal Informatika: Jurnal Pengembangan IT) is licensed under a Creative Commons Attribution 4.0 International License.