Lagrangian Relaxation in Iterated Local Search for the Workforce Scheduling and Routing Problem.
Hanyu GuYefei ZhangYakov ZinderPublished in: SEA² (2019)
Keyphrases
- iterated local search
- routing problem
- lagrangian relaxation
- vehicle routing problem
- vehicle routing problem with time windows
- tabu search
- np hard
- feasible solution
- scheduling problem
- integer programming
- shortest path
- metaheuristic
- multi start
- column generation
- branch and bound algorithm
- cutting plane algorithm
- lower bound
- linear programming
- dynamic programming
- flowshop
- lower and upper bounds
- combinatorial optimization
- scatter search
- valid inequalities
- optimal solution
- simulated annealing
- production planning
- travel time
- variable neighborhood search
- routing algorithm
- benchmark problems
- memetic algorithm
- genetic algorithm
- traveling salesman problem
- search algorithm
- search procedure
- global optimization
- single machine
- mixed integer programming
- special case
- single machine scheduling problem
- mixed integer
- search space
- particle swarm optimization
- np complete
- constraint programming
- approximation algorithms
- search heuristics
- constraint satisfaction problems