A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows.
Slim BelhaizaPierre HansenGilbert LaportePublished in: Comput. Oper. Res. (2014)
Keyphrases
- vehicle routing problem
- vehicle routing
- metaheuristic
- tabu search
- benchmark problems
- routing problem
- greedy randomized adaptive search procedure
- benchmark instances
- traveling salesman problem
- memetic algorithm
- travel time
- vehicle routing problem with time windows
- np hard
- hybrid metaheuristic
- iterated local search
- test instances
- multi depot
- particle swarm optimization
- combinatorial optimization
- pick up and delivery
- knapsack problem
- search strategies
- linear programming
- optimal solution
- variable neighborhood search
- lower bound
- dynamic programming
- scheduling problem
- simulated annealing
- optimization algorithm