Improved bounds for vehicle routing solutions

Discrete Optimization

Volumn 3, Issue 4, 2006, Pages 299-316

  Bompadre, Agustín ^a   Dror, Moshe ^b   Orlin, James B ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF ARIZONA   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithm; Lower bound; Vehicle routing problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; BOUNDARY VALUE PROBLEMS;

APPROXIMATION ALGORITHMS; SPLIT DELIVERIES; VEHICLE ROUTING PROBLEM (VRP);

OPERATIONS RESEARCH;

EID: 33748463814     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2006.04.002     Document Type: Article

References (16)

1. In: Aarts E., and Lenstra J.K. (Eds). Local Search in Combinatorial Optimization (1997), Wiley, Chichester
2. Altinkemer K., and Gavish B. Heuristics for unequal weight delivery problems with a fixed error guarantee. Operations Research Letters 6 (1987) 149-158
3. Altinkemer K., and Gavish B. Heuristics for delivery problems with constant error guarantees. Transportation Science 24 (1990) 294-297
4. S. Arora, Polynomial-time approximation schemes for euclidean tsp and other geometric problems, in: Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pp. 2-12
5. T. Asano, N. Katoh, H. Tamaki, T. Tokushama, Covering points in the plane by k-tours: A polynomial approximation scheme for fixed k, Research Report RT0162, IBM Tokyo Research Laboratory, 1996
6. T. Asano, N. Katoh, H. Tamaki, T. Tokushama, Covering points in the plane by k-tours: Towards a polynomial time approximation scheme for general k, in: Proceedings of STOC '97, 1997, pp. 275-283
7. Bell W.J., Dalberto L.M., Fisher M.L., Greenfield A.J., Jaikumar R., Kedia P., Mack R.G., and Prutzman P.J. Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces 13 (1983) 4-23
8. N. Christofides, Worst case analysis of a new heuristic for the traveling salesman problem, Research Report 388, Carnegie-Mellon University, Pittsburgh, PA, 1976
9. Cormen T.H., Leiserson C.E., and Rivest R.L. Introduction to Algorithms (1990), McGraw-Hill, New York, NY
10. Dror M., and Ball M. Inventory/routing: Reduction from an annual to a short-period problem. Naval Research Logistics 34 (1987) 891-905
11. Dror M., and Trudeau P. Savings by split delivery routing. Transportation Science 23 (1989) 141-145
12. Gabow H.N., and Tarjan R.E. Faster scaling algorithms for general graph-matching problems. Journal of the Association of Computing Machinery 38 (1991) 815-853
13. Haimovich M., and Rinnooy Kan A.H.G. Bounds and heuristics for capacitated routing problems. Mathematics of Operations Research 10 (1985) 527-542
14. Haimovich M., Rinnooy Kan A.H.G., and Stougie L. Analysis of heuristics for vehicle routing problems. Vehicle Routing, Methods and Studies (1988) 47-61
15. Li C.L., and Simchi-Levi D. Worst-case analysis of heuristics for the multi-depot capacitated vehicle routing problems. ORSA Journal on Computing 2 (1990) 64-73
16. J.S.B. Mitchell, Guillotine subdivisions approximate polygonal subdivisions: A simple new method for the geometric k-MST problem, in: Proc. 7th ACM-SIAM Sympos. Discrete Algorithms, 1996, pp. 402-408