Reaching the elementary lower bound in the vehicle routing problem with time windows.
Claudio ContardoGuy DesaulniersFrançois LessardPublished in: Networks (2015)
Keyphrases
- vehicle routing problem with time windows
- lower bound
- upper bound
- column generation
- branch and bound
- waste collection
- exact algorithms
- vehicle routing problem
- multi depot
- benchmark problems
- np hard
- branch and bound algorithm
- routing problem
- optimal solution
- integer programming
- worst case
- exact solution
- lower and upper bounds
- objective function
- cutting plane
- valid inequalities
- bayesian networks
- tabu search
- linear programming relaxation
- simulated annealing
- metaheuristic