A tabu search approach to the truck scheduling problem with multiple docks and time windows.
Jan Van BellePaul ValckenaersGreet Vanden BergheDirk CattryssePublished in: Comput. Ind. Eng. (2013)
Keyphrases
- tabu search
- vehicle routing problem
- scheduling problem
- metaheuristic
- memetic algorithm
- job shop scheduling problem
- simulated annealing
- path relinking
- vehicle routing
- feasible solution
- test problems
- search procedure
- routing problem
- heuristic methods
- quadratic assignment problem
- flowshop
- iterated local search
- hybrid algorithm
- search algorithm
- benchmark instances
- processing times
- weighted tardiness
- genetic algorithm
- multidimensional knapsack problem
- setup times
- graph colouring
- multi start
- variable neighborhood search
- travel time
- vehicle routing problem with time windows
- np hard
- single machine
- precedence constraints
- max sat
- crane scheduling
- mathematical programming
- tabu search algorithm
- job shop
- combinatorial optimization
- tabu list
- candidate list
- neighborhood search
- ant colony optimization
- test instances
- upper bound
- multi objective
- simulated annealing and tabu search
- scatter search