O problema do caixeiro viajante com múltiplos passageiros, bônus opcionais, quota e tempo

Abstract

This work presents the Traveling Salesman Problem with Multiple Passengers, Optional Bonus, Quota and Time. This problem has the objective of maximizing the profit of a traveling salesman who in addition to transporting goods can transport passengers to apportion their travel expenses. Goods and passengers must be transported from their origins to their destinations. The goods transported require loading and unloading time and must account for a minimum quota defined a priori. The salesman also decides whether or not to transport a goods or a passenger when visiting a locality. This work describes the problem, relating it to other problems and formalizes it mathematically. A nonlinear mathematical programming model, two heuristic algorithms and thirteen metaheuristic algorithms are proposed. The heuristics developed followed the meta-heuristics ACO, GRASP and Transgenetic. For this, two sets of test instances have been created, a computational experiment that compare and validates the algorithms proposed are presented.