Abordagens exatas para o Problema do Caixeiro Viajante Dubins com Vizinhanças.

Abstract

This work addresses the Dubins Traveling Salesman Problem with Neighborhoods, which is a variant of the TSP in which the vehicle is capable of meeting the demands of each location by flying over any location belonging to its neighborhood and must respect the movement dynamics of the Dubins vehicle. The first mathematical formulation for DTSPN is proposed, based on mixed-integer programming, which considers the integrated optimization of routes and trajectories. Furthermore, a formulation based on the generalized Benders distribution method is proposed in which the problem is decomposed into a master routing problem and a trajectory optimization subproblem. From the experiments carried out, the formulation based on mixedinteger programming proved to be numerically intractable and the solvers used were not able to find solutions to the problem. However, the method based on solving the problem was able to find optimal solutions for the tested instances and with the parameters used, thus proving the efficiency of the proposed algorithm.