A fast large neighbourhood based heuristic for the Two-Echelon Vehicle Routing Problem.
Ulrich BreunigVerena SchmidRichard F. HartlThibaut VidalPublished in: CoRR (2015)
Keyphrases
- vehicle routing problem
- tabu search
- benchmark instances
- multi depot
- tree search algorithm
- test instances
- combinatorial optimization
- iterated local search
- metaheuristic
- variable neighborhood search
- vehicle routing problem with time windows
- vehicle routing
- simulated annealing
- benchmark problems
- traveling salesman problem
- neighborhood search
- search strategies
- routing problem
- travel time
- memetic algorithm
- hybrid metaheuristic
- scheduling problem
- search procedure
- greedy randomized adaptive search procedure
- particle swarm optimization
- heuristic methods
- supply chain
- np hard
- logistics distribution
- job shop scheduling problem
- feasible solution
- multi start
- optimal solution
- optimization problems
- search algorithm
- genetic algorithm
- path relinking
- knapsack problem
- branch and bound
- evolutionary algorithm
- solution quality
- scatter search
- heuristic search
- ant colony optimization
- information retrieval systems
- cost function