OPTIMASI RUTE TERDEKAT: ALGORITMA BRANCH AND BOUND PADA APLIKASI MOBILE PEMANDU WISATA SERTA DUKUNGAN UMKM DI JAWA BARAT (STUDI KASUS: GEOPARK CILETUH PALABUHAN RATU)

Tourism is a crucial economic sector in Indonesia with a target foreign exchange tourism GDP contribution of 4.1% by 2023. Even so, tourist destinations in West Java are still poorly known due to lack of information from local tourism managers and agencies. To overcome this, the chillgo application was created, an Android- based guide application that integrates information on tourist destinations and MSMEs in West Java Province, aiming to be a source of information for tourists, tourism managers, tourism offices, and MSME players. MSMEs here as objects of souvenirs for tourists such as food and souvenirs so that a travel route is made to get to business and tourism actors. The result of this thesis is a guide application with the application of the Branch and Bound algorithm that can help in simplifying the process of selecting the closest route to the location object in the application efficiently and accurately. The optimization results show that the closest route generated is 1-2-6-9-10-1 (PTBUG-AC-RF-NF-PMG-PTBUG) with a total distance of 54.57 km. With this application, it can provide a solution to the problem of finding tourist information and help improve the quality of local people's income in trading.

Keywords: Tourism, MSMEs, Nearest Route, Branch and Bound, Android