A variable neighbourhood search algorithm for the open vehicle routing problem.

Krzysztof Fleszar Ibrahim H. Osman Khalil S. Hindi

Published in: Eur. J. Oper. Res. (2009)

Keyphrases

vehicle routing problem
search algorithm
tabu search
metaheuristic
routing problem
vehicle routing problem with time windows
vehicle routing
test instances
search strategies

travel time
traveling salesman problem
benchmark problems
multi depot
search space
benchmark instances
memetic algorithm
search methods
logistics distribution

np hard
hybrid metaheuristic
simulated annealing
combinatorial optimization
pick up and delivery
branch and bound
particle swarm optimization
variable neighborhood search
iterated local search

search procedure
hill climbing
genetic algorithm
greedy randomized adaptive search procedure
heuristic methods
heuristic search
lower bound
vehicle routing problem with simultaneous