Implementasi Algoritma Floyd Warshall Pada Aplikasi Dewan Masjid Indonesia (Dmi) Kota Semarang Untuk Menentukan Masjid Terdekat
Abstract
Location Based Service (LBS) is a service on smartphones that functions as a navigation device based on the user's position to determine the location where the user is. LBS utilizes GPS capabilities in finding geolocation information and sometimes using Google maps to display a complete map of the location. But the results of previous research studies Google Map does not give shortest and accessible routes. Furthermore, to improve work of LBS, Floyd Warshall algorithm is used because the algorithm has the principle of optimality in calculating the total of all routes optimally. According to data recorded by the Ministry of Religion of the Republic of Indonesia there have been 1,304 Mosques in the City of Semarang, but with this much data it should be easier to find places of worship for Muslims. Most mosques that are visited are mosques on the highway because it is more visible even though there are many other mosques that can be accessed. By using the White Box and Black Box tests, finding shortest path to find places of worship in the city of Semarang can be given accurately. The result was the Floyd Warshall algorithm could provide shortest path route and it was more accessible better than Google Map navigation.
Keywords
Full Text:
References
S. Y. Yang and C. L. Hsu, “A location-based services and Google maps-based information master system for tour guiding,” Comput. Electr. Eng., 2016.
A. Zipf and M. M. Jöst, “Location-based services,” in Springer Handbook of Geographic Information, 2012.
P. Battin and S. D. Markande, “Location based reminder Android application using Google Maps API,” in International Conference on Automatic Control and Dynamic Optimization Techniques, ICACDOT 2016, 2017.
D. Abdullah and U. Malikussaleh, “APLIKASI DATABASE MASJID BERBASIS WEB GIS,” no. January 2015, 2017.
W. Zheng, X. Huang, and Y. Li, “Understanding the tourist mobility using GPS: Where is the next place?,” Tour. Manag., 2017.
A. Syarif, I. Taufik, and A. Wahana, “Aplikasi Pemetaan Lokasi Kajian Ilmu Islam Serta Pencarian Rute Terbaik,” vol. 1, no. 2, pp. 202–206, 2018.
Z. Ramadhan, A. Putera Utama Siahaan, and M. Mesran, “Prim and Floyd-Warshall Comparative Algorithms in Shortest Path Problem,” 2018.
J. C. Dela Cruz, G. V. Magwili, J. P. E. Mundo, G. P. B. Gregorio, M. L. L. Lamoca, and J. A. Villasenor, “Items-mapping and route optimization in a grocery store using Dijkstra’s, Bellman-Ford and Floyd-Warshall Algorithms,” in IEEE Region 10 Annual International Conference, Proceedings/TENCON, 2017.
Risald, A. E. Mirino, and Suyoto, “Best routes selection using Dijkstra and Floyd-Warshall algorithm,” in Proceedings of the 11th International Conference on Information and Communication Technology and System, ICTS 2017, 2018.
B. L. Natarajan and M. K. Balaji, “Application of Graph Theory in Online Network Services to Determine the Shortest Journey,” Int. J. Adv. Netw. Appl., 2019.
V. Dhiman, S. Banerjee, J. M. Siskind, and J. J. Corso, “Floyd-Warshall Reinforcement Learning: Learning from Past Experiences to Reach New Goals,” 2018.
A. Aziz, M. M. Farid, and E. Suryani, “Floyd warshall algorithm with FIS Sugeno for search evacuation route optimization,” in Proceedings - 2017 International Seminar on Application for Technology of Information and Communication: Empowering Technology for a Better Human Life, iSemantic 2017, 2017.
Risald, A. E. Mirino, and Suyoto, “Best routes selection using Dijkstra and Floyd-Warshall algorithm,” Proc. 11th Int. Conf. Inf. Commun. Technol. Syst. ICTS 2017, vol. 2018-Janua, pp. 155–158, 2018.
I. Hussain and C. Bingcai, “Cluster Formation and Cluster Head Selection Approach for Vehicle Ad-Hoc Network (VANETs) using K-Means and Floyd-Warshall Technique,” Int. J. Adv. Comput. Sci. Appl., vol. 8, no. 12, pp. 11–15, 2017.
Y. S. Triana and I. Syahputri, “Implementation Floyd-Warshall Algorithm for the Shortest Path of Garage,” Int. J. Innov. Sci. Res. Technol. ISSN, vol. 3, no. 2, 2018.
A. V. Muholzoev and V. B. Masyagin, “Probabilistic Calculation of Tolerances of the Dimension Chain Based on the Floyd-warshall Algorithm,” Procedia Eng., vol. 150, pp. 959–962, 2016.
Y. Kang and S. Youm, “Multimedia application to an extended public transportation network in South Korea: optimal path search in a multimodal transit network,” Multimed. Tools Appl., vol. 76, no. 19, pp. 19945–19957, 2017.
M. S. Rahaman, Y. Mei, M. Hamilton, and F. D. Salim, “CAPRA: A contour-based accessible path routing algorithm,” Inf. Sci. (Ny)., vol. 385–386, pp. 157–173, 2017.
DOI: https://doi.org/10.30591/jpit.v8i3.4895
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Terindeks oleh :
