VRPPD
VRPPD stands for Vehicle Routing Problem with Pickup and Delivery. It generalizes the classic Vehicle Routing Problem (VRP) where each customer request has a pickup site and a delivery site. A fleet of vehicles with limited capacity must service all requests by transporting goods from pickups to deliveries while minimizing a cost objective such as total distance. Each pickup must be served before its corresponding delivery, and vehicle capacity cannot be exceeded along any route. Routes typically start and end at depots, and each request is serviced exactly once.
Constraints include precedence (pickup before delivery) and vehicle capacity; additional constraints may involve time windows, driver
Variants include VRPPD with time windows (VRPPDTW), multiple pickups and deliveries per route, multiple depots or
Solution approaches include exact formulations such as mixed-integer programming solved by branch-and-cut for small to moderate
Applications include urban logistics, parcel and courier networks, and e-commerce delivery, as well as certain healthcare