An efficient optimisation procedure for the Workforce Scheduling and Routing Problem: Lagrangian relaxation and iterated local search.
Hanyu GuYefei ZhangYakov ZinderPublished in: Comput. Oper. Res. (2022)
Keyphrases
- routing problem
- lagrangian relaxation
- iterated local search
- vehicle routing problem
- vehicle routing problem with time windows
- tabu search
- feasible solution
- np hard
- scheduling problem
- column generation
- integer programming
- search procedure
- shortest path
- multi start
- metaheuristic
- cutting plane algorithm
- branch and bound algorithm
- lower bound
- linear programming
- valid inequalities
- lower and upper bounds
- mixed integer programming
- scatter search
- dynamic programming
- travel time
- single machine scheduling problem
- routing algorithm
- flowshop
- variable neighborhood search
- genetic algorithm
- single machine
- path relinking
- simulated annealing
- optimal solution
- linear program
- special case
- search space
- traveling salesman problem
- global optimization
- branch and bound
- np complete
- ant colony optimization
- benchmark problems