Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem.
Andrea AttanasioJean-François CordeauGianpaolo GhianiGilbert LaportePublished in: Parallel Comput. (2004)
Keyphrases
- tabu search
- tabu search algorithm
- heuristic methods
- variable neighborhood search
- simulated annealing
- simulated annealing and tabu search
- metaheuristic
- search algorithm
- path relinking
- feasible solution
- scheduling problem
- memetic algorithm
- job shop scheduling problem
- genetic algorithm
- quadratic assignment problem
- hybrid algorithm
- variable neighbourhood search
- search heuristics
- benchmark instances
- graph colouring
- vehicle routing problem
- tabu list
- test problems
- initial solution
- search procedure
- candidate list
- multidimensional knapsack problem
- max sat
- multi start
- scatter search
- optimal solution
- iterated local search
- flowshop
- optimization problems
- multi objective
- hyper heuristics
- solution quality
- neural network
- ant colony optimization
- shared memory
- exact algorithms