Approximation Algorithms for Vehicle Routing Problems with Stochastic Demands on Trees
Shalabh VidyarthiKaushal K. ShuklaPublished in: CoRR (2013)
Keyphrases
- approximation algorithms
- vehicle routing problem
- np hard
- vehicle routing problem with time windows
- approximation schemes
- exact algorithms
- minimum cost
- vertex cover
- test instances
- routing problem
- special case
- metaheuristic
- worst case
- tabu search
- travel time
- benchmark problems
- combinatorial optimization
- traveling salesman problem
- primal dual
- memetic algorithm
- integer programming
- approximation ratio
- decision trees
- linear programming
- scheduling problem
- lower bound
- knapsack problem
- np complete
- combinatorial optimization problems
- simulated annealing
- optimal solution
- particle swarm optimization
- job shop scheduling problem
- computational complexity
- greedy randomized adaptive search procedure
- guided local search
- precedence constraints
- branch and bound algorithm
- constant factor
- neural network
- linear program