Hybrid column generation and large neighborhood search for the dial-a-ride problem.
Sophie N. ParraghVerena SchmidPublished in: Comput. Oper. Res. (2013)
Keyphrases
- column generation
- vehicle routing
- branch and bound
- linear programming
- linear program
- grasp with path relinking
- exact solution
- constraint programming
- integer programming
- integer linear programming
- set partitioning
- optimal solution
- integer program
- vehicle routing problem with time windows
- lagrangean relaxation
- cutting plane
- lagrangian relaxation
- mixed integer programming
- linear programming problems
- set covering
- linear programming relaxation
- vehicle routing problem
- upper bound
- cost function
- cutting plane algorithm
- lower bound
- search algorithm
- special case
- dual variables