A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem.
Gerardo BerbegliaJean-François CordeauGilbert LaportePublished in: INFORMS J. Comput. (2012)
Keyphrases
- tabu search
- simulated annealing
- constraint programming
- hybrid algorithm
- metaheuristic
- memetic algorithm
- search procedure
- computational complexity
- tabu search algorithm
- np hard
- search heuristics
- cost function
- optimal solution
- dynamic programming
- test problems
- scheduling problem
- quadratic assignment problem
- heuristic methods
- job shop scheduling problem
- randomly generated
- scatter search
- column generation
- variable neighborhood search
- genetic algorithm
- constraint propagation
- search space
- space complexity
- knapsack problem
- hill climbing
- feasible solution
- genetic algorithm ga
- ant colony optimization
- benchmark instances
- linear programming
- evolutionary algorithm
- bin packing
- objective function
- neural network