The Traveling Salesman Problem with Multiple Passengers Optional Bonus Quota and Time
Traveling Salesman Problem, Mathematical programming, Metaheuristic, ACO, GRASP, Computational Transgenic.
The presents work the Traveling Salesman Problem with Multiple Passengers Optional Bonus Quota and Time. The problem has the objective of maximizing the profit of a traveling salesman goods carrier. The salesman 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. The work describes the problem, relates it to other problems, and formalizes it. A quadratic mathematical programming model, two heuristic algorithms, and eleven metaheuristic algorithms are proposed. Meta-heuristics were developed following the meta-heuristics ACO, GRASP and Transgenetic. Two linearizations of quadratic mathematical programming model is also proposed, and two sets of test instances. A computational experiment that compare and validates the models and algorithms proposed is also presented.