A column generation-based heuristic for a rehabilitation patient scheduling and routing problem.
Liyang XiaoLu ZhenGilbert LaporteRoberto BaldacciChenghao WangPublished in: Comput. Oper. Res. (2022)
Keyphrases
- column generation
- routing problem
- vehicle routing
- set partitioning
- lagrangean relaxation
- optimal solution
- mixed integer programming
- integer linear programming
- lagrangian relaxation
- vehicle routing problem with time windows
- set covering
- branch and bound
- grasp with path relinking
- linear programming
- linear program
- linear programming relaxation
- dantzig wolfe
- vehicle routing problem
- integer programming
- dantzig wolfe decomposition
- integer program
- cutting plane
- constraint programming
- exact solution
- scheduling problem
- combinatorial optimization
- routing algorithm
- travel time
- tabu search
- cutting plane algorithm
- search algorithm
- search strategies
- global optimization
- dynamic programming
- metaheuristic
- traveling salesman problem
- search space
- simulated annealing
- genetic algorithm
- lower bound
- valid inequalities
- heuristic methods
- constraint satisfaction