Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows

Authors:
C. Archetti;M. Bouchard;G. Desaulniers
Affiliations:
Department of Quantitative Methods, University of Brescia, 25122 Brescia, Italy;Mechanical Engineering Department, Université Laval, Forac Research Consortium, Québec G1V 0A6, Canada;Ecole Polytechnique de Montréal and GERAD, Montréal, Québec H3C 3A7, Canada
Venue:
Transportation Science
Year:
2011

Citing 15
Cited 1

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
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
The vehicle routing problem

The vehicle routing problem
2-Path Cuts for the Vehicle Routing Problem with Time Windows

Transportation Science
A Lower Bound for the Split Delivery Vehicle Routing Problem

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

Transportation Science
Worst-Case Analysis for Split Delivery Vehicle Routing Problems

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

Networks
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows

Operations Research
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem

Transportation Science
Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows

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

Operations Research
Cutting planes for branch-and-price algorithms

Networks
A column generation approach for the split delivery vehicle routing problem

Operations Research Letters

Survey of Green Vehicle Routing Problem: Past and future trends

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we study the split delivery vehicle routing problem with time windows (SDVRPTW) that is a variant of the well-known vehicle routing problem with time windows (VRPTW), where each customer can be served by more than one vehicle. We propose enhancement procedures for the exact branch-and-price-and-cut algorithm that was recently developed for the SDVRPTW. In particular, we introduce a tabu search algorithm to solve the column-generation subproblem, extensions of several classes of valid inequalities, and a new separation algorithm for the k-path inequalities. Computational results show the effectiveness of the proposed enhancements.