Dijkstra-based Official Motorcycle Repair Shop Application for Determining the Shortest Route
DOI:
https://doi.org/10.33633/jais.v8i2.8593Abstract
Servicing on 2-wheeled vehicles is needed so that the condition remains prime and minimizes the symptoms of component damage. Motorcycle service activities have an impact on the automotive world, especially in the City of Kudus. There are also many motorized vehicle users who do not know the closest route to the nearest Authorized Motorcycle Workshop in the holy city and choose Engine Fuel (BBM) that is in accordance with the type of vehicle they have. shorter service life because the RON (Research Octane Number) or octane number for each motorized vehicle is different, the octane number represents the resistance of the fuel to engine compression. With the development of information science in the current era, an Android-based application was created to search for the closest route to an official motorcycle repair shop in the Kudus City using the Djikstra Algorithm and having a BBM recommendation feature that is suitable for motorbike users' vehicles in the Kudus City.References
V. O. Wijaya and B. Daniawan, “Information System Design of Online Motorcycle and Car Repair Shop Using Dijkstra Method,” JOURNAL OF TECH-E, 2021, [Online]. Available: http://bsti.ubd.ac.id/e-jurnal
I. P. Sari, M. F. Fahroza, M. I. Mufit, and I. F. Qathrunad, “Implementation of Dijkstra’s Algorithm to Determine the Shortest Route in a City,” Journal of Computer Science, Information Technologi and Telecommunication Engineering, Mar. 2021, doi: 10.30596/jcositte.v2i1.6503.
T. Setya Darmawan, “Best Route; Dijkstra and Floyd-Warshall Algorithm. (IJID),” 2018.
Yujin and G. Xiaoxue, “Optimal Route Planning of Parking Lot Based on Dijkstra Algorithm,” in Proceedings - 2017 International Conference on Robots and Intelligent System, ICRIS 2017, Institute of Electrical and Electronics Engineers Inc., Nov. 2017, pp. 221–224. doi: 10.1109/ICRIS.2017.62.
Risald, A. E. Mirino, and Suyoto, “Best Routes Selection Using Djisktra and Floyd-Warshall Algorithm,” in International Conference on Information & Communication Technology and System (ICTS), IEEE, 2017.
R. D. Gunawan, R. Napianto, R. I. Borman, and I. Hanifah, “IMPLEMENTATION OF DIJKSTRA’S ALGORITHM IN DETERMINING THE SHORTEST PATH (CASE STUDY: SPECIALIST DOCTOR SEARCH IN BANDAR LAMPUNG),” International Journal Information System and Computer Science (IJISCS), 2020.
S. W. G. Abusalim, R. Ibrahim, M. Zainuri Saringat, S. Jamel, and J. Abdul Wahab, “Comparative Analysis between Dijkstra and Bellman-Ford Algorithms in Shortest Path Optimization,” in IOP Conference Series: Materials Science and Engineering, IOP Publishing Ltd, Sep. 2020. doi: 10.1088/1757-899X/917/1/012077.
M. Wei, T. Liu, B. Sun, and B. Jing, “Optimal Integrated Model for Feeder Transit Route Design and Frequency-Setting Problem with Stop Selection,” J Adv Transp, vol. 2020, 2020, doi: 10.1155/2020/6517248.
S. M. Nasution, E. Husni, K. Kuspriyanto, R. Yusuf, and B. N. Yahya, “Contextual route recommendation system in heterogeneous traffic flow,” Sustainability (Switzerland), vol. 13, no. 23, Dec. 2021, doi: 10.3390/su132313191.
L. G. Asri and Annisa, “Application of skyline query on route selection (the Case Study of Bogor City Roadway),” in 2020 International Conference on Computer Science and Its Application in Agriculture, ICOSICA 2020, Institute of Electrical and Electronics Engineers Inc., Sep. 2020. doi: 10.1109/ICOSICA49951.2020.9243182.
S. Ahdan and S. Setiawansyah, “Android-Based Geolocation Technology on a Blood Donation System (BDS) Using the Dijkstra Algorithm,” IJAIT (International Journal of Applied Information Technology), vol. 5, no. 01, p. 1, Jul. 2021, doi: 10.25124/ijait.v5i01.3317.
L. S. Liu et al., “Path Planning for Smart Car Based on Dijkstra Algorithm and Dynamic Window Approach,” Wirel Commun Mob Comput, vol. 2021, 2021, doi: 10.1155/2021/8881684.
M. Luo, X. Hou, and J. Yang, “Surface Optimal Path Planning Using an Extended Dijkstra Algorithm,” IEEE Access, vol. 8, pp. 147827–147838, 2020, doi: 10.1109/ACCESS.2020.3015976.
S. M. Nasution, E. Husni, K. Kuspriyanto, R. Yusuf, and B. N. Yahya, “Contextual route recommendation system in heterogeneous traffic flow,” Sustainability (Switzerland), vol. 13, no. 23, Dec. 2021, doi: 10.3390/su132313191.
D. Rachmawati and L. Gustin, “Analysis of Dijkstra’s Algorithm and A? Algorithm in Shortest Path Problem,” in Journal of Physics: Conference Series, Institute of Physics Publishing, Jul. 2020. doi: 10.1088/1742-6596/1566/1/012061.
V. Natali, C. Sebayang, and I. Rosyida, “Implementations of Dijkstra Algorithm for Searching the Shortest Route of Ojek Online and a Fuzzy Inference System for Setting the Fare Based on Distance and Difficulty of Terrain (Case Study: in Semarang City, Indonesia),” in Proceedings of the International Conference on Mathematics, Geometry, Statistics, and Computation (IC-MaGeStiC), 2021, pp. 75–84.
Downloads
Published
Issue
Section
License
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution 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 (See The Effect of Open Access).
