Abstract
Two ideas for using structural information for solving the Vehicle
Routing Problem with Time Windows (VRPTW) is presented. The VRPTW is
a generalization of the well known capacity constrained Vehicle
Routing Problem (VRP). Both techniques are based on solving the
VRPTW using a Branch-and-Price approach. They reveal a huge
potential for using structural information when speeding up an
exact approach without compromising optimality.
| Original language | English |
|---|
| Publication status | Published - 2002 |
|---|