Path inequalities for the vehicle routing problem with time windows.
Brian KallehaugeNatashia BolandOli B. G. MadsenPublished in: Networks (2007)
Keyphrases
- vehicle routing problem with time windows
- valid inequalities
- cutting plane algorithm
- waste collection
- column generation
- multi depot
- integer programming
- routing problem
- benchmark problems
- vehicle routing problem
- lower and upper bounds
- shortest path
- traveling salesman problem
- exact algorithms
- linear programming
- cutting plane
- convex hull
- mixed integer
- optimization problems
- genetic algorithm
- dynamic programming
- hyper heuristics
- integer program
- mixed integer programming
- neural network
- combinatorial optimization