An exponential (matching based) neighborhood for the vehicle routing problem.
Eric AngelEvripidis BampisFanny PascualPublished in: J. Comb. Optim. (2008)
Keyphrases
- vehicle routing problem
- metaheuristic
- routing problem
- vehicle routing
- benchmark problems
- vehicle routing problem with time windows
- hybrid metaheuristic
- traveling salesman problem
- tabu search
- benchmark instances
- test instances
- travel time
- particle swarm optimization
- logistics distribution
- combinatorial optimization
- iterated local search
- pick up and delivery
- multi depot
- vehicle routing problem with simultaneous
- memetic algorithm
- variable neighborhood search
- knapsack problem
- ant colony optimization
- knn