Implementasi Algoritma Dijkstra dalam Pencarian Klinik Hewan Terdekat

Shandy Yosua, Canro Sigalingging, Jamal Jipesya, Yuwan Jumaryadi

Abstract


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.

Keywords


Dijkstra’s Algorithm; Scrum; Pet Owners

Full Text:

PDF

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.




DOI: http://dx.doi.org/10.22441/fifo.2021.v13i1.009

Refbacks

  • There are currently no refbacks.


Jurnal Ilmiah FIFO
Portal ISSNPrint ISSN: 2085-4315
Online ISSN: 2502-8332

Sekretariat
Fakultas Ilmu Komputer
Universitas Mercu Buana
Jl. Raya Meruya Selatan, Kembangan, Jakarta 11650
Tlp./Fax: +62215871335

http://publikasi.mercubuana.ac.id/index.php/fifo

e-mail:[email protected]

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

Web Analytics Made Easy - StatCounter
View My Stats

 

width= width=