PENERAPAN ALGORITMA DIJKSTRA PADA PENCARIAN RUTE TERCEPAT 10 TEMPAT WISATA DI BALI

Abstract

The purpose of the study is to find the shortest route to 10 favorite tourist attractions in Bali using the Dijkstra Algorithm. Ten tourist attractions were collected using a questionnaire data of 400 respondents. Analysis of the questionnaire data sought the 10 largest percentages. Dijkstra's algorithm is used to find the shortest route considering the weight of 2 places. Weight in the form of length and duration of the trip. The two zero points used are Gilimanuk Harbor and I Gusti Ngurah Rai Airport. As well as two modes of transportation, namely: motorcycles and cars. The result of the shortest route is obtained from I Gusti Ngurah Rai Airport by motorbike mode of transportation. The development of the study is the use of another zero point. In the digital field, online applications can be developed using the Dijkstra Algorithm to find the fastest route from several tourist attractions.

ABSTRAK

Tujuan kajian mencari rute terpendek 10 tempat wisata favorit di Bali dengan Algoritma Dijkstra. Sepuluh tempat wisata dikumpulkan dengan data kuesioner 400 responden. Analisis data kuesioner dicari 10 persentase terbesar. Algoritma Dijkstra digunakan untuk mencari rute terpendek mempertimbangkan bobot 2 tempat. Bobot berupa panjang dan lama perjalanan. Dua titik nol yang digunakan adalah Pelabuhan Gilimanuk dan Bandara I Gusti Ngurah Rai. Serta dua moda transportasi, yaitu: sepeda motor dan mobil. Hasil rute terpendek diperoleh dari Bandara I Gusti Ngurah Rai dengan moda transportasi sepeda motor. Pengembangan kajian berupa penggunaan titik nol lain. Di bidang digital dapat dikembangkan aplikasi online memanfaatkan Algoritma Dijkstra mencari rute tercepat dari beberapa tempat wisata.