PENERAPAN ALGORITMA TRAVELLING SALESMAN PROBLEM PROBLEM WITH PRECEDENCE CONSTRAINT (TSPPC) PADA OPTIMALISASI RUTE TERPENDEK PEMANDU WISATA DI YOGYAKARTA BERBASIS ANDROID

MARDHON TSAH ZAKI, NIM. 10651066 (2016) PENERAPAN ALGORITMA TRAVELLING SALESMAN PROBLEM PROBLEM WITH PRECEDENCE CONSTRAINT (TSPPC) PADA OPTIMALISASI RUTE TERPENDEK PEMANDU WISATA DI YOGYAKARTA BERBASIS ANDROID. Skripsi thesis, UIN SUNAN KALIJAGA YOGYAKARTA.

Preview	Text (PENERAPAN ALGORITMA TRAVELLING SALESMAN PROBLEM PROBLEM WITH PRECEDENCE CONSTRAINT (TSPPC) PADA OPTIMALISASI RUTE TERPENDEK PEMANDU WISATA DI YOGYAKARTA BERBASIS ANDROID) 10651066_BAB-I_IV-atau-V_DAFTAR-PUSTAKA_2.pdf Download (2MB) | Preview
	Text (PENERAPAN ALGORITMA TRAVELLING SALESMAN PROBLEM PROBLEM WITH PRECEDENCE CONSTRAINT (TSPPC) PADA OPTIMALISASI RUTE TERPENDEK PEMANDU WISATA DI YOGYAKARTA BERBASIS ANDROID) 10651066_BAB-II_sampai_SEBELUM-BAB-TERAKHIR.pdf Restricted to Registered users only Download (2MB)

Abstract

Yogyakarta is one of tourism and cultural centers. There are many tourists whether domestic or internationaltourists who come to Yogyakarta because it has many tourist attractions which can be visited with various uniqueness. There are natural tourism, museums, souvenirs shops, and temples. Those are tourist attractions which can be visited in Yogyakarta. This system is using Travelling Salesman Problem With Precedence Constraints algorithm. The purpose of using this algorithm is to decide the shortest path based on the shortest path from one point to another point. For example, a point shows a location where we want to go and the line is the path, then on the application of Travelling Salesman Problem With Precedence Constraints (TSPPC) algorithm, the algorithm calculates for all the possible shortest distances from any point.Another difference which become the focus of the research is to apply the Travelling Salesman Problem With Precedence Constraints (TSPPC) algorithm with the concept of searching for closest distance to a location for the multi-purpose. The use of the searching concept to a location is done to get globally optimal solution in terms of distance. The search of shortest route begins by knowing the start point and the destination that will be visited. The start point and the destination which are known will be used on the development process of route and the shortest route search. This system can show the user’s location with tourism lcation with its information. The system can show the closest tourism to the user on Google Maps without considering problems that can affect travel times such as traffic jam, road width, and traffic light. According to the result of functional system testing, all respondents agree that the application functions properly. According to interface system testing, shows that 85% is agree and 15% is neutral.

Share this knowledge with your friends :

Actions (login required)

View Item