A Lagrangian relaxation-based heuristic for the vehicle routing with full container load.
Akio ImaiEtsuko NishimuraJohn R. CurrentPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- lagrangian relaxation
- vehicle routing
- column generation
- branch and bound
- mixed integer programming
- integer programming
- linear programming
- logistics distribution
- mixed integer program
- optimal solution
- constraint programming
- set covering problem
- linear program
- vehicle routing problems with time windows
- cutting plane
- vehicle routing and scheduling
- randomly generated test problems
- lower bound
- dual decomposition
- feasible solution
- linear programming relaxation
- network design problem
- branch and bound algorithm
- np hard
- cutting plane algorithm
- vehicle routing problem with time windows
- lower and upper bounds
- lagrangian heuristic
- vehicle routing problem
- single machine scheduling problem
- dynamic programming
- upper bound
- branch and bound search
- neural network
- cellular automata