A large neighbourhood based heuristic for two-echelon routing problems.
Ulrich BreunigVerena SchmidRichard F. HartlThibaut VidalPublished in: Comput. Oper. Res. (2016)
Keyphrases
- routing problem
- multi depot
- depth first search
- variable neighborhood search
- vehicle routing problem
- search procedures
- vehicle routing problem with time windows
- tabu search
- routing algorithm
- traveling salesman problem
- combinatorial optimization
- shortest path
- vehicle routing
- scheduling problem
- cutting plane algorithm
- optimal solution
- supply chain
- heuristic methods
- metaheuristic
- multi item
- dynamic programming