2011•Transportation ScienceRequires access

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

Claudia Archetti, Mathieu Bouchard, Guy Desaulniers

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.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 99 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Vehicle routing problem, Column generation, Tabu search, Mathematical optimization, Routing (electronic design automation), Path (computing), Computer science, Branch and cut