Implementasi Algoritma Dijkstra dalam Pencarian Klinik Hewan Terdekat
DOI:
https://doi.org/10.22441/fifo.2021.v13i1.009Keywords:
Dijkstra’s Algorithm, Scrum, Pet OwnersAbstract
The application of technology that is increasingly developing is almost felt to benefit in various aspects of life, one of which is in terms of searching for veterinary clinics. This study aims to help animal owners who have difficulty in finding clinics and shops that sell various kinds of animal needs closest to the user's location. This research uses the Scrum method, which consists of Product Backlog, Sprint Backlog, Sprint and Imcrement. The output from Dijkstra's algorithm can display the location and route of the closest veterinary clinic to application users wherever they are in an average of 4 minutes 29 seconds.Downloads
References
S. Dewi, L. M. Jannah, and Y. Jumaryadi, “Analisis dan Perancangan Sistem Informasi Manajemen Aset Tetap Pada PT. Metis Teknologi Corporindo,” JUST IT J. Sist. Informasi, Teknol. Inf. dan Komput., vol. 9, no. 1, pp. 81–91, 2018.
C. M. Andrews et al., “Mobile Technology in Veterinary Clinical Medicine,” J. Vet. Med. Res., vol. 2, no. 1, 2015.
H. Mehta, P. Kanani, and P. Lande, “Google Maps,” Int. J. Comput. Appl., vol. 178, no. 8, pp. 41–46, 2019.
E.E. Dijkstra, “A note on Two Problems in Connextion with Graphs,” Numer. Math., vol. 1, pp. 269–271, 1959, doi: 10.1037/h0066879.
R. Lewis, “Algorithms for finding shortest paths in networks with vertex transfer penalties,” Algorithms, vol. 13, no. 11, pp. 1–21, 2020, doi: 10.3390/a13110269.
M. K. Harahap and N. Khairina, “Pencarian Jalur Terpendek dengan Algoritma Dijkstra,” SinkrOn, vol. 2, no. 2, p. 18, 2017, doi: 10.33395/sinkron.v2i2.61.
J. Sauwani, V. N. Putra, and H. Agung, “Implementasi Algoritma Djikstra Untuk Menentukan Lokasi dan Jarak Tempuh Terpendek Kampus IT di Jakarta,” J. Inform., vol. 6, no. 1, pp. 29–36, 2019, doi: 10.31311/ji.v6i1.4723.
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,” IOP Conf. Ser. Mater. Sci. Eng., vol. 917, no. 1, pp. 0–11, 2020, doi: 10.1088/1757-899X/917/1/012077.
N. Azizah and D. Mahendra, “Geolocation dengan Metode Djikstra untuk Menentukan Jalur Terpendek Lokasi Peribadatan,” J. Sist. Inf. Bisnis, vol. 7, no. 2, p. 96, 2017, doi: 10.21456/vol7iss2pp96-103.
S. Sunardi, A. Yudhana, and A. A. Kadim, “Implementasi Algoritma Dijkstra dan Algoritma Semut Untuk Analisis Rute Transjogja Berbasis Android,” It J. Res. Dev., vol. 4, no. 1, pp. 1–9, 2019, doi: 10.25299/itjrd.2019.vol4(1).2483.
Downloads
Published
How to Cite
Issue
Section
License
The copyright to this article is transferred to Universitas Mercu Buana (UMB) if and when the article is accepted for publication. The undersigned hereby transfers any and all rights in and to the paper including without limitation all copyrights to UMB. The undersigned hereby represents and warrants that the paper is original and that he/she is the author of the paper, except for material that is clearly identified as to its original source, with permission notices from the copyright owners where required. The undersigned represents that he/she has the power and authority to make and execute this assignment.
We declare that this paper has not been published in the same form elsewhere.
Furthermore, I/We hereby transfer the unlimited rights of publication of the above-mentioned paper as a whole to UMB. The copyright transfer covers the right to reproduce and distribute the article, including reprints, translations, photographic reproductions, microform, electronic form (offline, online) or any other reproductions of similar nature.
The corresponding author signs for and accepts responsibility for releasing this material on behalf of any and all co-authors. This agreement is to be signed by at least one of the authors who have obtained the assent of the co-author(s) where applicable. After submission of this agreement signed by the corresponding author, changes of authorship or in the order of the authors listed will not be accepted.
Retained Rights/Terms and Conditions
Although authors are permitted to re-use all or portions of the Work in other works, this does not include granting third-party requests for reprinting, republishing, or other types of re-use.
Our Articles are licensed under CC BY-NC
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
