O PROBLEMA DO CAIXEIRO VIAJANTE APLICADO À ROTEIRIZAÇÃO TURÍSTICA: APLICATIVO MÓVEL PARA VISITANTES DE TRINDADE-GO

Abstract

Religious tourism is a prominent sector in Brazil, and the city of Trindade-GO stands out as an important pilgrimage destination. The objective of this work is to present a mobile application for tourist route planning, formulated as an application of the Traveling Salesman Problem (TSP), aiming to support visitors in planning their movements. As a method, routes are computed using the Google OR-Tools library, applying the PathCheapestArc heuristic combined with a local search refinement stage, based on distance matrices obtained from the Open Source Routing Machine (OSRM). As results, the system was able to generate personalized routes according to the user’s location, achieving average response times below four seconds in the performed tests. It is concluded that the developed prototype demonstrated technical feasibility and potential to enhance the tourist experience in religious tourism contexts.