A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows.
Olli BräysyPublished in: INFORMS J. Comput. (2003)
Keyphrases
- vehicle routing problem with time windows
- variable neighborhood search
- vehicle routing problem
- routing problem
- metaheuristic
- tabu search
- benchmark problems
- traveling salesman problem
- scatter search
- travel time
- optimization problems
- search algorithm
- search procedure
- single machine scheduling problem
- hyper heuristics
- path relinking
- simulated annealing
- global optimization
- genetic algorithm
- np hard
- combinatorial optimization
- heuristic methods
- routing algorithm
- memetic algorithm
- search space
- integer programming
- shortest path
- particle swarm optimization
- approximation algorithms
- feasible solution
- ant colony optimization
- computational complexity