An adaptive large neighborhood search for a vehicle routing problem with multiple routes.
Nabila AziMichel GendreauJean-Yves PotvinPublished in: Comput. Oper. Res. (2014)
Keyphrases
- vehicle routing problem
- metaheuristic
- vehicle routing
- routing problem
- benchmark problems
- hybrid metaheuristic
- tabu search
- vehicle routing problem with time windows
- test instances
- traveling salesman problem
- travel time
- memetic algorithm
- np hard
- combinatorial optimization
- particle swarm optimization
- benchmark instances
- knapsack problem
- neighborhood search
- multi depot
- simulated annealing
- variable neighborhood search
- iterated local search
- optimization problems
- neural network
- logistics distribution
- pick up and delivery