A column generation heuristic for the dynamic bicycle rebalancing problem.
Marte D. GleditschKristine HagenHenrik AnderssonSteffen J. BakkerKjetil FagerholtPublished in: Eur. J. Oper. Res. (2024)
Keyphrases
- column generation
- lagrangean relaxation
- mixed integer programming
- integer linear programming
- optimal solution
- set covering
- branch and bound
- lagrangian relaxation
- set covering problem
- linear programming
- integer programming
- grasp with path relinking
- linear program
- vehicle routing
- set partitioning
- linear programming relaxation
- constraint programming
- hybrid meta heuristic
- search algorithm
- integer program
- dantzig wolfe
- exact solution
- cutting plane
- search tree
- branch and bound algorithm
- beam search
- vehicle routing problem with time windows
- insertions and deletions
- np hard
- linear programming problems
- combinatorial optimization
- upper bound
- dynamic programming
- complete search
- valid inequalities
- metaheuristic
- heuristic methods