Multicriteria pickup and delivery problem with transfer opportunity
Computers and Industrial Engineering
The vehicle routing problem
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
INFORMS Journal on Computing
The vehicle routing problem with flexible time windows and traveling times
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem
Transportation Science
Worst-Case Analysis for Split Delivery Vehicle Routing Problems
Transportation Science
Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers
Transportation Science
| Hi-index | 0.00 |
The pickup and delivery problem (PDP) asks to find a set of vehicles that serve a given set of requests with the minimum travel cost, where each request consists of a pickup point, a delivery point and a load (the quantity to be delivered from the pickup point to the delivery point). In the pickup and delivery problem with transfer (PDPT), for each request, its load picked up at the pickup point is allowed to be dropped at a transshipment point before it is picked up again and delivered to the delivery point by another vehicle. This paper analyzes the maximum travel cost that can be saved by introducing a transshipment point to the pickup and delivery problem (PDP). We show that the bounds are in proportion to square root of the number of cycles in an optimal PDPT solution and also square root of the number of requests. We furthermore present an instance that the bound is the tight for a special case.