A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking.
Philippe GrangierMichel GendreauFabien LehuédéLouis-Martin RousseauPublished in: Comput. Oper. Res. (2017)
Keyphrases
- vehicle routing problem
- metaheuristic
- benchmark problems
- tabu search
- routing problem
- vehicle routing problem with time windows
- test instances
- vehicle routing
- hybrid metaheuristic
- combinatorial optimization
- travel time
- traveling salesman problem
- benchmark instances
- simulated annealing
- np hard
- memetic algorithm
- multi depot
- search strategies
- particle swarm optimization
- iterated local search
- logistics distribution
- shortest path
- dynamic programming
- genetic algorithm
- neural network
- knapsack problem
- cost function
- variable neighborhood search