-Path Inequalities for the Vehicle Routing Problem with Time Windows.
Guy DesaulniersFrançois LessardAhmed HadjarPublished in: Transp. Sci. (2008)
Keyphrases
- vehicle routing problem with time windows
- valid inequalities
- cutting plane algorithm
- waste collection
- column generation
- multi depot
- vehicle routing problem
- routing problem
- integer programming
- benchmark problems
- traveling salesman problem
- linear programming
- exact algorithms
- convex hull
- shortest path
- mixed integer programming
- cutting plane
- mixed integer
- feasible solution
- hyper heuristics
- search strategies
- lower and upper bounds
- constraint programming
- np complete