Implementasi Algoritma Best-First Search (BeFS) pada Penyelesaian Traveling Salesman Problem (TSP) (Studi Kasus: Perjalanan Wisata Di Kota Yogyakarta)

Yogyakarta offers many tourist attractions, from nature based tourism, culinary tourism until cultural tourism. With so many tourist attractions offered by Yogyakarta, tourist often finds it difficult to arrange their travel schedule (from choosing which tourist attractions to be visited until choos...

Full description

Bibliographic Details
Main Authors: Muchammad Abrori, Rike Nur Setiyani
Format: Article
Language:Indonesian
Published: Universitas Islam Negeri Sunan Kalijaga Yogyakarta 2015-10-01
Series:Jurnal Fourier
Online Access:http://fourier.or.id/index.php/FOURIER/article/view/38
id doaj-723e879214454e05a2aa9b0dd28f9db3
record_format Article
spelling doaj-723e879214454e05a2aa9b0dd28f9db32020-11-24T21:07:35ZindUniversitas Islam Negeri Sunan Kalijaga YogyakartaJurnal Fourier2252-763X2541-52392015-10-01429311110.14421/fourier.2015.42.93-11138Implementasi Algoritma Best-First Search (BeFS) pada Penyelesaian Traveling Salesman Problem (TSP) (Studi Kasus: Perjalanan Wisata Di Kota Yogyakarta)Muchammad Abrori0Rike Nur Setiyani1UIN Sunan KalijagaUIN Sunan KalijagaYogyakarta offers many tourist attractions, from nature based tourism, culinary tourism until cultural tourism. With so many tourist attractions offered by Yogyakarta, tourist often finds it difficult to arrange their travel schedule (from choosing which tourist attractions to be visited until choosing which route tourist should takes to maximize their vacation time). Therefore, it’s required to have a way to determine the shortest tour route so tourist can make their tour in the Yogyakarta effective. This problem can be categorized as Traveling Salesman Problem (TSP) case. There are a lot of methods can be used to find the shortest route in Travelling Salesman Problems (TSP) case. To solve the problem, which is to find the shortest tour route in Yogyakarta, Algorithm Best-First Travelling will be used in this undergraduate thesis. The implementation of Algorithm Best-First Search to find the shortest tour route in Yogyakarta can be used to produce a solution for tourist to choose the shortest tour package and decide which route they should take. The premium tour package produces tour route from Adi Sucipto Airport-Gembira Loka Zoo- Purawisata-N’dalem Gamelan Hotel-Yogyakarta Palace-Benteng Vredeburg Museum-Taman Pintar-Tamansari-Adi Sucipto Airport with distance covered 20.297 meter. The middle tour package produces tour route from Tugu railway station-Benteng Vredeburg Museum- Taman Pintar-Yogyakarta Palace-Mawar Asri Hotel-Tamansari-Purawisata-Gembira Loka Zoo-Tugu railway station with distance covered 11.772 meter. The economy tour package produces tour route from Giwangan bus station- Gembira Loka zoo-Purawisata-Yogyakarta Palace-Mitra Hotel-Benteng Vredeburg Museum-Taman Pintar-Tamansari-Giwangan bus station with distance covered 14.037 meter.http://fourier.or.id/index.php/FOURIER/article/view/38
collection DOAJ
language Indonesian
format Article
sources DOAJ
author Muchammad Abrori
Rike Nur Setiyani
spellingShingle Muchammad Abrori
Rike Nur Setiyani
Implementasi Algoritma Best-First Search (BeFS) pada Penyelesaian Traveling Salesman Problem (TSP) (Studi Kasus: Perjalanan Wisata Di Kota Yogyakarta)
Jurnal Fourier
author_facet Muchammad Abrori
Rike Nur Setiyani
author_sort Muchammad Abrori
title Implementasi Algoritma Best-First Search (BeFS) pada Penyelesaian Traveling Salesman Problem (TSP) (Studi Kasus: Perjalanan Wisata Di Kota Yogyakarta)
title_short Implementasi Algoritma Best-First Search (BeFS) pada Penyelesaian Traveling Salesman Problem (TSP) (Studi Kasus: Perjalanan Wisata Di Kota Yogyakarta)
title_full Implementasi Algoritma Best-First Search (BeFS) pada Penyelesaian Traveling Salesman Problem (TSP) (Studi Kasus: Perjalanan Wisata Di Kota Yogyakarta)
title_fullStr Implementasi Algoritma Best-First Search (BeFS) pada Penyelesaian Traveling Salesman Problem (TSP) (Studi Kasus: Perjalanan Wisata Di Kota Yogyakarta)
title_full_unstemmed Implementasi Algoritma Best-First Search (BeFS) pada Penyelesaian Traveling Salesman Problem (TSP) (Studi Kasus: Perjalanan Wisata Di Kota Yogyakarta)
title_sort implementasi algoritma best-first search (befs) pada penyelesaian traveling salesman problem (tsp) (studi kasus: perjalanan wisata di kota yogyakarta)
publisher Universitas Islam Negeri Sunan Kalijaga Yogyakarta
series Jurnal Fourier
issn 2252-763X
2541-5239
publishDate 2015-10-01
description Yogyakarta offers many tourist attractions, from nature based tourism, culinary tourism until cultural tourism. With so many tourist attractions offered by Yogyakarta, tourist often finds it difficult to arrange their travel schedule (from choosing which tourist attractions to be visited until choosing which route tourist should takes to maximize their vacation time). Therefore, it’s required to have a way to determine the shortest tour route so tourist can make their tour in the Yogyakarta effective. This problem can be categorized as Traveling Salesman Problem (TSP) case. There are a lot of methods can be used to find the shortest route in Travelling Salesman Problems (TSP) case. To solve the problem, which is to find the shortest tour route in Yogyakarta, Algorithm Best-First Travelling will be used in this undergraduate thesis. The implementation of Algorithm Best-First Search to find the shortest tour route in Yogyakarta can be used to produce a solution for tourist to choose the shortest tour package and decide which route they should take. The premium tour package produces tour route from Adi Sucipto Airport-Gembira Loka Zoo- Purawisata-N’dalem Gamelan Hotel-Yogyakarta Palace-Benteng Vredeburg Museum-Taman Pintar-Tamansari-Adi Sucipto Airport with distance covered 20.297 meter. The middle tour package produces tour route from Tugu railway station-Benteng Vredeburg Museum- Taman Pintar-Yogyakarta Palace-Mawar Asri Hotel-Tamansari-Purawisata-Gembira Loka Zoo-Tugu railway station with distance covered 11.772 meter. The economy tour package produces tour route from Giwangan bus station- Gembira Loka zoo-Purawisata-Yogyakarta Palace-Mitra Hotel-Benteng Vredeburg Museum-Taman Pintar-Tamansari-Giwangan bus station with distance covered 14.037 meter.
url http://fourier.or.id/index.php/FOURIER/article/view/38
work_keys_str_mv AT muchammadabrori implementasialgoritmabestfirstsearchbefspadapenyelesaiantravelingsalesmanproblemtspstudikasusperjalananwisatadikotayogyakarta
AT rikenursetiyani implementasialgoritmabestfirstsearchbefspadapenyelesaiantravelingsalesmanproblemtspstudikasusperjalananwisatadikotayogyakarta
_version_ 1716762278116720640