OPTIMAL TRAVEL PLANNING IN TERMS OF DISTANCE AND TRAVEL TIME IN CENTRAL KALIMANTAN USING K-MEANS CLUSTERING ALGORITHM

Abstract

Optimal journey planning is an important aspect of the tourism industry. In Central Kalimantan, a province with a wide range of tourist destinations and travel challenges, finding travel routes that minimise distance and travel time is an issue for new tourists. Therefore, in this study helping tourists have a well-organised itinerary, tourists can spend more time enjoying the tourist attractions and activities they enjoy rather than being stuck in a long journey. This application called Optimal Travel Planning focuses on how the proposed algorithm can optimise the application in terms of processing time for the benefit of system efficiency. To create an optimal travel plan, the user must enter the number of days to travel, starting location, and tourist destinations to be visited. Tourist destinations will be clustered using the K-Means Clustering algorithm, then the Travelling Salesman Problem solution will be found for the best or shortest route in each cluster. The development of this application is expected to help and provide a better and more efficient travel experience for tourists visiting Central Kalimantan.