A metaheuristic based on tabu search for solving a technician routing and scheduling problem.
Ines MathlouthiMichel GendreauJean-Yves PotvinPublished in: Comput. Oper. Res. (2021)
Keyphrases
- tabu search
- metaheuristic
- scheduling problem
- combinatorial optimization
- simulated annealing
- path relinking
- search heuristics
- iterated local search
- optimization problems
- vehicle routing problem
- feasible solution
- ant colony optimization
- flowshop
- memetic algorithm
- scatter search
- search procedure
- mip solver
- search algorithm for solving
- search space
- genetic algorithm
- combinatorial optimization problems
- benchmark instances
- heuristic methods
- optimal solution
- particle swarm optimization
- hybrid algorithm
- test problems
- routing problem
- combinatorial problems
- multi start
- variable neighborhood search
- max sat
- initial solution
- nature inspired
- evolutionary algorithm
- mixed integer program
- traveling salesman problem
- np hard
- single machine
- job shop scheduling problem
- branch and bound
- guided local search
- multi objective
- candidate list
- variable neighbourhood search
- quadratic assignment problem
- setup times
- hyper heuristics
- processing times
- single machine scheduling problem
- timetabling problem
- branch and bound algorithm
- routing algorithm
- mathematical programming