Approximation algorithms for some vehicle routing problems.
Cristina BazganRefael HassinJérôme MonnotPublished in: Discret. Appl. Math. (2005)
Keyphrases
- approximation algorithms
- vehicle routing problem
- np hard
- vehicle routing problem with time windows
- exact algorithms
- special case
- metaheuristic
- test instances
- vertex cover
- routing problem
- tabu search
- minimum cost
- worst case
- travel time
- traveling salesman problem
- benchmark problems
- optimal solution
- np complete
- approximation ratio
- lower bound
- branch and bound algorithm
- scheduling problem
- memetic algorithm
- primal dual
- particle swarm optimization
- integer programming
- combinatorial optimization problems
- precedence constraints
- linear programming
- guided local search
- constant factor
- computational complexity
- knapsack problem
- combinatorial optimization
- constraint satisfaction problems
- variable neighborhood search
- upper bound
- multi objective
- greedy randomized adaptive search procedure
- job shop scheduling problem
- optimization problems
- randomized algorithms
- search space