Penerapan Algoritma Floyd-Warshall pada Jalur Evakuasi Korban Kecelakaan di Boyolali

Fitri Nofita Sari, Juhari Juhari, erna Herawati


The Floyd-Warshall algorithm is one of the algorithms that can be used to solve the shoetest route problem and is the easiests to apply because it can find all the shortest routes between each possible pair of position and is part of a dynamic program that is very efficient in solving optimal route promblems. The Floyd-Warshall algorithm works by comparing each possible path on the graph for each node pair and checking the resulting node combination. The problem of the shortest route in daily life is the evacuation of victims of traffic accidents in Boyolali, Central Java. For evacuation to be more effective, a nearby route to the nearest hospital is needed. Based on the results of the research that has been done, it can be concluded that the study produced reference matrix in the form of the shortest trajectory used to determine the shortest route to nearest hospital in Boyolali, Central Java.


shortest route; graph; Floyd-Warshall algorithm node

Full Text:



J. Agung, T. Efendi and H. Agung, "Analisis Perbandingan Algoritma Floyd-Warshall

dengan Algoritma Bellman-Ford Dalam Pencarian Rute Terpendek Menuju Museum

di Jakarta," Kalbi Scientia Jurnal Sains dan Teknologi, vol. 1, pp. 4-5, 2018.

Siswanto, Opertions Research Jilid 1, Jakarta: Erlangga, 2006.

T. Dermawan, "Comparison of Djikstra dan Floyd-Wharshall Algorithm to Determinethe Best Route of Train," Internasional Journal on Informatics for Development, vol. 2,

p. 9, 2019.

J. Murdowo, "Memprihatinkan. Jumlah Kecelakaan di Boyolali Meningkat 101 Persen

dari Tahun 2020," Suara Merdeka, Boyolali, 2020.

M. Arfananda, Nasution and Setianingsih, "A Selection of Bandung City Travel Route

Using The Floyd-Warshall Algorithm. The International Journal of Integrated

Engineering," The International Journal of Integrated Engineering, vol. 1 No 12, pp. 4-

, 2020.

M. Yudha, A. Rahmani and S. Purwani, "Finding Shortest Path at Padjadjaran

University Using Floyd-Warshall Algorithm," World Scientific News An International

Scientific Journal, vol. 7, pp. 7-8, 2022.

S. Usman, I. Wiranto and Nurwan, "Aplikasi Algoritma Floyd-Warshall untuk

Mengoptimalkan Distribusi Listrik di PLN Kota Gorontalo," Research in the

Mathematical and Natural Sciences, vol. 1, p. 8, 2022.

M. Shahid, H. Khawar and A. Kamal, "The Mathematical Model for searching the

Shortest Route for Tuberculosis Patients with the help of Dijkstra’s Algorithm,"

Sukkur IBA of Computing and Mathematical Sciences, vol. 1, p. 4, 2021.

N. Faizah, "Ternyata Ini Ruas Jalan Paling Rawan Kecelakaan di Boyolali," Solopos,

Boyolali, 2022.

R. M. McLeod, K. Ranson and L. Biehl, The generalized Riemann integral, JSTOR,

C. Godsil and G. F. Royle, Algebraic graph theory, vol. 207, Springer Science &

Business Media, 2013.

A. Gara, M. A. Blumrich, D. Chen, G.-T. Chiu, P. Coteus, M. E. Giampapa, R. A. Haring, P.

Heidelberger, D. Hoenicke, G. V. Kopcsay and others, "Overview of the Blue Gene/L

system architecture," IBM Journal of Research and Development, vol. 49, no. 2, pp.

-212, 2005.

J. France, J. H. Thornley and others, Mathematical models in agriculture.,

Butterworths, 1984.

F. E. Browder, "Nonexpansive nonlinear operators in a Banach space," Proceedings of

the National Academy of Sciences, vol. 54, no. 4, pp. 1041-1044, 1965.

M. J. Berger and J. Oliger, "Adaptive mesh refinement for hyperbolic partial

differential equations," Journal of computational Physics, vol. 53, no. 3, pp. 484-512,



  • There are currently no refbacks.