A Reactive Greedy Randomized Variable Neighborhood Tabu Search for the Vehicle Routing Problem with Time Windows.
Panagiotis P. RepoussisDimitris C. ParaskevopoulosChristos D. TarantilisGeorge IoannouPublished in: Hybrid Metaheuristics (2006)
Keyphrases
- vehicle routing problem with time windows
- tabu search
- vehicle routing problem
- iterated local search
- metaheuristic
- search algorithm
- simulated annealing
- multi start
- hill climbing
- routing problem
- path relinking
- feasible solution
- benchmark problems
- scheduling problem
- search procedure
- exact algorithms
- greedy algorithm
- heuristic methods
- memetic algorithm
- genetic algorithm
- hyper heuristics
- scatter search
- search space
- column generation
- max sat
- dynamic programming
- search methods
- travel time
- valid inequalities
- knapsack problem
- combinatorial optimization problems
- combinatorial optimization
- search heuristics
- optimization problems
- branch and bound
- neural network