2-Path Cuts for the Vehicle Routing Problem with Time Windows

, , , , and

BibTeX reference

This paper introduces a strong valid inequality, the 2-path cut, to produce better lower bounds for the Vehicle Routing Problem with Time Windows (VRPTW). It also develops an effective separation algorithm to find such inequalities. We next incorporate them as needed in the master problem of a Dantzig-Wolfe decomposition approach. In this enhanced optimization algorithm, the coupling constraints require that each customer be serviced. The subproblem is a Shortest Path Problem with Time Window and Capacity Constraints. We apply Branch and Bound to obtain integer solutions. We first branch on the number of vehicles if this is fractional, and then on the flow variables. The algorithm has been implemented and tested on problems of up to 100 customers from the Solomon data sets. It has succeeded in solving to optimality several previously unsolved problems and a new 150 customer problem. In addition, the algorithm proved faster than algorithms previously considered in the literature. These computational results indicate the effectiveness of the valid inequalities we have developed.

, 30 pages

This cahier was revised in November 1997

Research Axes

Research application