A column generation and Combinatorial Benders Decomposition algorithm for the Selective Dial-A-Ride-Problem.
Yannik RistMichael A. ForbesPublished in: Comput. Oper. Res. (2022)
Keyphrases
- decomposition algorithm
- column generation
- linear programming
- branch and bound
- integer programming
- linear program
- decomposition method
- optimal solution
- vehicle routing
- working set
- exact solution
- constraint programming
- mixed integer programming
- lagrangean relaxation
- cutting plane
- set partitioning
- integer linear programming
- lagrangian relaxation
- integer program
- genetic algorithm
- lower bound
- linear programming relaxation
- vehicle routing problem with time windows
- recognition algorithm
- dantzig wolfe decomposition
- dantzig wolfe
- upper bound
- computational complexity
- search algorithm
- working set selection