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. Two mathematical formulations are presented for the problem and validated through a computational experiment employing a mathematical solver. Four heuristic algorithms are proposed, being three hybrid metaheuristic algorithms. Computational results are presented. Future work is proposed.