A column generation approach for the split delivery vehicle routing problem

Authors:
Mingzhou Jin;Kai Liu;Burak Eksioglu
Affiliations:
Department of Industrial and Systems Engineering, Mississippi State University, P.O. Box 9542, MS 39762, USA;Department of Industrial and Systems Engineering, Mississippi State University, P.O. Box 9542, MS 39762, USA;Department of Industrial and Systems Engineering, Mississippi State University, P.O. Box 9542, MS 39762, USA
Venue:
Operations Research Letters
Year:
2008

Citing 5
Cited 7

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
Traveling Salesman Problems with Profits

Transportation Science
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

Transportation Science

Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows

Operations Research
A tabu search with vocabulary building approach for the vehicle routing problem with split demands

International Journal of Metaheuristics
An adaptive memory algorithm for the split delivery vehicle routing problem

Journal of Heuristics
A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem

Expert Systems with Applications: An International Journal
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
A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A column generation approach is presented for the split delivery vehicle routing problem with large demand. Columns include route and delivery amount information. Pricing sub-problems are solved by a limited-search-with-bound algorithm. Feasible solutions are obtained iteratively by fixing one route once. Numerical experiments show better solutions than in the literature.