A survey of approximation algorithms for capacitated vehicle routing problems.
Yongyu ChenPublished in: CoRR (2023)
Keyphrases
- approximation algorithms
- vehicle routing problem
- np hard
- routing problem
- special case
- network design problem
- facility location problem
- minimum cost
- vehicle routing problem with time windows
- metaheuristic
- test instances
- vertex cover
- benchmark problems
- travel time
- tabu search
- integer programming
- primal dual
- worst case
- optimal solution
- combinatorial optimization problems
- knapsack problem
- traveling salesman problem
- memetic algorithm
- lower bound
- branch and bound algorithm
- combinatorial optimization
- linear programming
- scheduling problem
- undirected graph
- exact algorithms
- approximation ratio
- constant factor
- search strategies
- lagrangian relaxation
- particle swarm optimization
- precedence constraints
- dynamic programming
- greedy randomized adaptive search procedure