Meta-heurística grasp aplicada no auxílio da elaboração de roteiros turísticos

Abstract

This undergraduate thesis proposes a tool to aid in the creation of travel itineraries, considering tourist attractions previously selected by the visitor. Two approaches are explored to address the problem: the first traces the itinerary without returns to the hotel, while the second divides the itinerary into travel days, allowing the tourist to return to the hotel at the end of each day. In both approaches, a mathematical model from the literature is used, solved with an optimization solver. In the first approach, the classic Traveling Salesman Problem (TSP) is solved, while in the second, the TSP model is adapted to represent the division of the trip into days. Additionally, the resolution of these approaches is proposed through an adaptation of the Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic, aiming to find optimized solutions that minimize travel costs. The solutions generated by the metaheuristic for both approaches are analyzed and compared with the results obtained by the solver, showing that the metaheuristic finds competitive solutions. These solutions can support decision-making in the creation and formatting of travel itineraries, benefiting both tourists and industry managers.