An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation.
Niklas KohlOli B. G. MadsenPublished in: Oper. Res. (1997)
Keyphrases
- optimization algorithm
- lagrangian relaxation
- vehicle routing problem with time windows
- column generation
- integer programming
- valid inequalities
- multi objective
- linear programming
- differential evolution
- branch and bound
- mixed integer programming
- cutting plane algorithm
- cutting plane
- np hard
- feasible solution
- constraint programming
- linear program
- optimal solution
- integer program
- lower bound
- exact solution
- lower and upper bounds
- production planning
- dynamic programming
- vehicle routing problem
- branch and bound algorithm
- artificial bee colony
- network flow
- genetic programming
- primal dual
- routing problem