On the approximability of two capacitated vehicle routing problems.
Adrian BockLaura SanitàPublished in: Electron. Notes Discret. Math. (2013)
Keyphrases
- vehicle routing problem
- routing problem
- metaheuristic
- tabu search
- benchmark problems
- np hard
- vehicle routing problem with time windows
- approximation algorithms
- test instances
- multi depot
- traveling salesman problem
- memetic algorithm
- benchmark instances
- travel time
- waste collection
- knapsack problem
- particle swarm optimization
- combinatorial optimization
- neural network
- neighborhood search
- greedy randomized adaptive search procedure
- linear programming
- optimal solution