The Traveling Salesamn with Collect of Opatative Bonuses, Passengers, Collection Time, and Time Window (PCVP-DJT).
Vehicle Routing, Traveling Salesman Problem, Metaheuristics, Integer Programming, Mathematical Programming, Passenger Transport Systems
The paper examines a variant of the Traveling Salasman Problema called The Traveling Salesamn with Collect of Opatative Bonuses, Passengers, Collection Time, and Time Window (PCVP-DJT).This is a variant that involves vehicle routing, passenger ridesharing, and the execution of a courier's tasks.A mathematical programming model for the problem is developed.The model is validated in a computational experiment.An instance bank was built to test solution algorithms.It develops a heuristic algorithm composed by exact solutions of the subproblems of the model, and a hybrid meta-heuristic algorithm with semiglossous base.Computational results are presented.Future work is proposed.