Journal
TRANSPORTATION SCIENCE
Volume 45, Issue 3, Pages 285-298Publisher
INFORMS
DOI: 10.1287/trsc.1100.0363
Keywords
vehicle routing; time windows; split deliveries; branch and price; valid inequalities; tabu search column generator
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available