A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing.
Aparna DasClaire MathieuPublished in: Algorithmica (2015)
Keyphrases
- vehicle routing
- vehicle routing problem
- routing problem
- polynomial time approximation
- travel time
- logistics distribution
- column generation
- vehicle routing problems with time windows
- metaheuristic
- np hard
- inventory management
- tabu search
- benchmark problems
- approximation algorithms
- search strategies
- lot sizing
- selection scheme
- vehicle routing and scheduling
- shortest path
- simulated annealing
- neural network