Approximation algorithms for a vehicle routing problem.
Sven Oliver KrumkeSleman SalibaTjark VredeveldStephan WestphalPublished in: Math. Methods Oper. Res. (2008)
Keyphrases
- vehicle routing problem
- approximation algorithms
- np hard
- special case
- routing problem
- vehicle routing
- tabu search
- test instances
- metaheuristic
- worst case
- vertex cover
- approximation ratio
- vehicle routing problem with time windows
- travel time
- hybrid metaheuristic
- np complete
- scheduling problem
- minimum cost
- benchmark problems
- primal dual
- combinatorial optimization problems
- multi depot
- knapsack problem
- branch and bound algorithm
- traveling salesman problem
- linear programming
- lower bound
- network design problem
- optimal solution
- computational complexity
- constant factor
- constraint satisfaction problems
- combinatorial optimization
- memetic algorithm
- integer programming
- linear program
- randomized algorithms
- neural network
- simulated annealing
- search strategies
- closest string