Implementasi Algoritma Djikstra Dalam Menentukan Rute Terpendek Pengantaran Pasien Menggunakan Ambulans di Kabupaten Jember Berbasis Website

Abstract

Jember Regency has a total of 49 units of health centers and 12 units of hospitals. One form of the government's efforts to provide health services to the community is that in every sub-district there is a government agency as a public health service delivery unit, namely the Community Health Center (Puskesmas), while at the regional level there are health service delivery units, namely hospitals (RS). To support patient safety when experiencing an emergency, health centers and hospitals handle patients quickly, one of which is using an ambulance. One way to determine the shortest route is by using the Djikstra algorithm. The research steps were carried out using the Djikstra algorithm, namely collecting data nodes consisting of 49 puskesmas nodes, 12 hospital nodes, 32 district center nodes, and 11 point and road data in Jember Regency. The next step after all data nodes have been collected is to create a directed and weighted graph. From the results of the road representation in graph form, the next step is to determine the neighbor node (nearest node) and measure the distance using Google Maps. From the results of these calculations, it is implemented into a website which will result in finding the shortest route from the health center to the health center and the health center to the hospital. In building this system, writing program code using the PHP programming language (hypertext preprocessor) and the database used is MySQL.