Optimization of the Shortest Route to Tourist Attractions in Tangerang Regency Using Genetic Algorithm with the Traveling Salesman Problem Approach

Tangerang Regency has numerous tourist destinations spread across various locations. However, tourists often face difficulties in determining an efficient travel route due to traffic congestion and irregular distances between sites. This issue leads to suboptimal travel time and reduces the overall comfort of the tourism experience. This study aims to optimize tourism travel routes in Tangerang Regency using a genetic algorithm approach based on the Travelling Salesman Problem (TSP). Data were collected from 17 tourist attractions, including their geographical coordinates, and processed through several genetic algorithm stages: population initialization, selection, crossover, and mutation. The results show that the genetic algorithm successfully produced an optimal route with a total distance of 109.77 km and the best fitness value of 0.009110. Compared to the initial distance before optimization, which was 215.80 km, this result indicates a travel distance efficiency improvement of 49.15%. These findings suggest that the genetic algorithm approach provides an effective solution for tourism route planning. The results are expected to serve as a basis for developing tourism promotion strategies and improving infrastructure in Tangerang Regency.