vi
ABSTRAK
Tempat wisata merupakan salah satu tempat yang sesuai untuk dikunjungi dalam menikmati liburan dan berkumpul bersama keluarga serta teman-teman. Pencarian lintasan terpendek diperlukan untuk menghemat waktu dan biaya perjalanan. Dalam pencarian rute terpendek antar tempat wisata tersebut akan diterapkan ke dalam sebuah graph. Dalam menyelesaikan graph diperlukan pula algoritma, algoritma yang akan digunakan yaitu algoritma L-Deque dan algoritma Greedy, di mana algoritma L-Deque penambahan dan penghapusan elemennya dapat dilakukan pada kedua sisi ujung list, tetapi tidak dapat dilakukan di tengah-tengah
list dan algoritma Greedy memecahkan masalah langkah demi langkah. Dalam algoritma Greedy solusi yang diberikan tidak selalu benar-benar optimum tetapi pasti memberikan solusi yang mendekati nilai optimum. Impementasikan sistem dengan menggunakan bahasa pemrograman C#. Hasil dari penelitian ini diperoleh rute, total jarak dan running time yang berbeda di mana algoritma Greedy memiliki nilai running time Ө (n) dan algoritma L-Deque Ө (n2) serta total jarak yang dihasilkan algoritma L-Deque lebih optimum dibandingkan algoritma Greedy.
Kata kunci : Tempat Wisata, Shortest path, Graph, Algoritma L-Deque, Algoritma Greedy
COMPARISON OF L-DEQUE ALGORITHM AND GREEDY ALGORITHM IN DETERMINING THE SHORTEST PATH
OF TOUR PLACES IN TAPANULI TENGAH DISTRICT
ABSTRACT
vii
Tour place is one of the most suitable places to visit to enjoy the holidays and let go of daily activities and a good place to gather with family and friends. The computer system can be used to perform the shortest path search, which is implemented in the simulation model. The shortest path search is needed to save time and travel expenses. The faster the tourists get to the tour place of one then the more time also owned tourists to visit other places. In search for the shortest path of tour places will be applied to a graph. In solving the graph algorithm is also required, the algorithm to be used is the L-Deque algorithm and Greedy algorithm, where the L-Deque algorithm addition and deletion of elements can be done on both sides of the list end, but can not be done in the middle of the list and Greedy algorithm solve Step-by-step problem. In the Greedy algorithm the given solution is not always really optimum but it certainly gives a solution that is close to the optimum value. Based on the results of the shortest path search of tour places in Kabupaten Tapanuli Tengah using L-Deque algorithm and Greedy algorithm produce route, total distance and running time different whereas Greedy algorithm has running time value faster than L-Deque algorithm and total distance L-Deque algorithm is produced more optimum compared to Greedy's algortima.
Key Words : Tour Place, Shortest Path, Graph, L-Deque Algorithm, Greedy Algortihm
