Vehicle routing with split deliveries
Discrete Applied Mathematics
The split delivery vehicle scheduling problem with time windows and grid network distances
Computers and Operations Research
A Lower Bound for the Split Delivery Vehicle Routing Problem
Operations Research
Complexity and Reducibility of the Skip Delivery Problem
Transportation Science
Worst Case Analysis for Pickup and Delivery Problems with Transfer
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A Column Generation Algorithm for a Rich Vehicle-Routing Problem
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
A tabu search heuristic for ship routing and scheduling with flexible cargo quantities
Journal of Heuristics
A new metaheuristic for the vehicle routing problem with split demands
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
A tabu search with vocabulary building approach for the vehicle routing problem with split demands
International Journal of Metaheuristics
Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic
Transportation Science
An adaptive memory algorithm for the split delivery vehicle routing problem
Journal of Heuristics
Coordination of split deliveries in one-warehouse multi-retailer distribution systems
Computers and Industrial Engineering
Planning for a bus-based evacuation
OR Spectrum
Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows
Transportation Science
Improved lower bounds for the Split Delivery Vehicle Routing Problem
Operations Research Letters
Computers and Industrial Engineering
Survey of Green Vehicle Routing Problem: Past and future trends
Expert Systems with Applications: An International Journal
Local search techniques for a routing-packing problem
Computers and Industrial Engineering
Hi-index | 0.00 |
In the vehicle routing problem (VRP) the objective is to construct a minimum cost set of routes serving all customers where the demand of each customer is less than or equal to the vehicle capacity and where each customer is visited once. In the split delivery vehicle routing problem (SDVRP) the restriction that each customer is visited once is removed. We show that the cost savings that can be realized by allowing split deliveries is at most 50. We also study the variant of the VRP in which the demand of a customer may be larger than the vehicle capacity, but where each customer has to be visited a minimum number of times. We show that the cost savings that can be realized by allowing more than the minimum number of required visits is again at most 50. Furthermore, we analyze the performance of simple heuristics that handle customers with demands larger than the vehicle capacity by employing full load out-and-back trips to these customers until the demands become less than or equal to the vehicle capacity. Finally, we investigate situations in which demands are discrete and vehicle capacities are small.