When trees collide: an approximation algorithm for the generalized Steiner problem on networks
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A vehicle routing problem with stochastic demand
Operations Research
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Algorithms for Capacitated Vehicle Routing
SIAM Journal on Computing
Exact and heuristic dynamic programming algorithms for the vehicle routing problem with stochastic demands
ACM SIGACT News
Selecting good a priori sequences for vehicle routing problem with stochastic demand
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
| Hi-index | 0.00 |
In the Vehicle Routing Problem (VRP), as in the Traveling Salesman Problem (TSP), we have a metric space of customer points, and we have to visits all customers. Additionally, every customer has a demand, a quantity of a commodity that has to be delivered in our vehicle from a single point called the depot. Because the vehicle capacity is bounded, we need to return to the depot each time we run out of the commodity to distribute. We describe a fully polynomial time algorithm with approximation 2.5, we also modify this algorithm for the on-line version of VRP, the randomized version has competitive ratio of 2.5 on the average, and the deterministic version has ratio 4. We also describe 2 approximation for a restricted version of the problem.