The multi-depot split delivery vehicle routing problem: An integer programming-based heuristic, new test problems, and computational results

Authors:
Damon Gulczynski;Bruce Golden;Edward Wasil
Affiliations:
Department of Mathematics, University of Maryland, College Park, MD 20742, United States;Robert H. Smith School of Business, University of Maryland, College Park, MD 20742, United States;Kogod School of Business, American University, Washington, DC 20016, United States
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 10
Cited 0

Computerized vehicle routing in the soft drink industry

Operations Research
A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions

American Journal of Mathematical and Management Sciences - Special issue: vehicle routing 2000: advances in time windows, optimality, fast bounds, & multi-depot routing
A tabu search heuristic for the multi-depot vehicle routing problem

Computers and Operations Research
A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

Journal of Heuristics
Very large-scale vehicle routing: new test problems, algorithms, and results

Computers and Operations Research
A general heuristic for vehicle routing problems

Computers and Operations Research
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

Transportation Science
The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results

Networks
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
Coordination of split deliveries in one-warehouse multi-retailer distribution systems

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The multi-depot split delivery vehicle routing problem combines the split delivery vehicle routing problem and the multiple depot vehicle routing problem. We define this new problem and develop an integer programming-based heuristic for it. We apply our heuristic to 30 instances to determine the reduction in distance traveled that can be achieved by allowing split deliveries among vehicles based at the same depot and vehicles based at different depots. We generate new test instances with high-quality, visually estimated solutions and report results on these instances.