Penentuan Rute Terpendek Pada Objek Wisata Di Kabupaten Banyumas Menggunakan Metode Travelling Salesman Problem Dengan ILP (Integer Linier Programming)

Muhamad, Wahyu Ammar (2023) Penentuan Rute Terpendek Pada Objek Wisata Di Kabupaten Banyumas Menggunakan Metode Travelling Salesman Problem Dengan ILP (Integer Linier Programming). Undergraduate Thesis thesis, Institut Teknologi Telkom Purwokerto.

[img] Text
Cover (2).pdf
Download (1MB)
[img] Text
Abstract (2).pdf
Download (193kB)
[img] Text
Abstrak (2).pdf
Download (139kB)
[img] Text
BAB I (2).pdf
Download (280kB)
[img] Text
BAB II (2).pdf
Download (360kB)
[img] Text
BAB III (2).pdf
Download (416kB)
[img] Text
BAB IV (2).pdf
Restricted to Registered users only
Download (742kB) | Request a copy
[img] Text
BAB V (2).pdf
Download (247kB)
[img] Text
Daftar Pustaka (1).pdf
Download (197kB)
[img] Text
Lampiran (2).pdf
Restricted to Registered users only
Download (325kB) | Request a copy

Abstract

The tourism industry has a fairly high contribution to the economy in Indonesia. In Central Java Province, Banyumas Regency is a rather popular tourist destination. The quickest route to tourist destinations in the Banyumas region is required to make it simpler for visitors to travel farther, faster, and for less money. Traveling Salesman Problem (TSP) involves finding the shortest path between all destinations and the starting point. To find the shortest path between nine tourism destinations in Banyumas Regency, we used the Integer Linear Programming (ILP) approach in this study. Based on the results of the study, the route taken from each starting point has the same travel route and the distance traveled is not much different. The travel route from Banyumas Square includes the Alun-alun → Bale Kemambang Park →Small world → Baturaden Lokawisata → Limpakuwus Pine Forest → Germanggis → Dream Land Water Park → Temple Outbound → THR Pangsar Soedirman → Curug Song → Alun-alun, with the distance traveled which is 117.3 KM. Keywords: Integer Linear Programming, , Shortest Route, Tourism, Traveling Salesman Problem

Item Type: Thesis (Undergraduate Thesis)
Subjects: T Technology > TA Engineering (General). Civil engineering (General)
Divisions: Faculty of Industrial Engineering and Design > Industrial Engineering
Depositing User: pustakawan ittp
Date Deposited: 28 Apr 2023 06:15
Last Modified: 28 Apr 2023 06:15
URI: http://repository.ittelkom-pwt.ac.id/id/eprint/9495

Actions (login required)

View Item View Item
Repository IT Telkom Purwokerto is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.