Traveling Salesman Problem with Quota, Multiple Passengers, Incomplete Transportation and bonus with time penalty.
The Traveling Salesman with Quota and Passengers, Combinatorial Optimization, Collaborative Transport, Mathematical Programming, Meta-Heuristics.
The Quota Travelling Salesman Problem with Passengers, Incomplete Ride, and Collection Time is a new version of the Quota Travelling Salesman Problem. In this problem, the salesman uses a flexible ridesharing system to minimize travel costs while visiting some vertices to satisfy a pre-established quota. We consider operational constraints regarding vehicle capacity, travel time, passenger limitations, and penalties for rides that do not meet passenger requirements. We present a mathematical formulation, and exact and heuristics approaches to solve this problem.