PERBANDINGAN ALGORITMA DIJKSTRA DAN ALGORITMA FLOYD WARSHALL PADA PENCARIAN RUTE PARIWISATA DI KOTA PALEMBANG
Total View This Week0

Institusion

Universitas Sriwijaya

Author

PRATAMA, SURACHMAD
Rifkie Primartha (LECTURER ID : 0001067709)
Danny Matthew Saputra (LECTURER ID : 0010058507)

Subject

R858-859.7 Computer applications to medicine. Medical informatics 

Datestamp

2019-10-02 05:05:02 

Abstract :
Route search from one point to another is a problem that is often encountered in everyday life. Various groups have encountered similar problems with different variations. Dijkstra and Floyd Warshall algorithms are used to find the optimal route to tourism locations in Palembang. In applying the Dijksta algorithm and the Floyd Warshall algorithm on the search for tourism routes in Palembang city data is needed in the form of nodes, edges to create graph maps, congestion, one way roads and vehicle speeds. Tests were carried out using 9 hotel locations and 10 tourism locations in Palembang in the case of single destrination and multi destination. From the results of the study the optimal results obtained by Dijkstra's algorithm and Floyd Warshall's algorithm, and Dijkstra's algorithm use less memory and route search process times faster than the Floyd Warshall algorithm. 

File :
RAMA_55201_09021381419081_0001067709_0010058507_01_front_ref.pdf
RAMA_55201_09021381419081_0001067709_0010058507_02.pdf
RAMA_55201_09021381419081_0001067709_0010058507_03.pdf
RAMA_55201_09021381419081_0001067709_0010058507_04.pdf
RAMA_55201_09021381419081_0001067709_0010058507_05.pdf
RAMA_55201_09021381419081_0001067709_0010058507_06.pdf
RAMA_55201_09021381419081_0001067709_0010058507_07_ref.pdf
RAMA_55201_09021381419081_0001067709_0010058507_08_lamp.pdf