Probabilistic analysis of unit-demand vehicle routeing problems

Journal of Applied Probability

Volumn 44, Issue 1, 2007, Pages 259-278

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

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Optiant Inc   (United States)

^d UNIVERSITY OF ARIZONA   (United States)

Author keywords

Heuristic; Probabilistic analysis of algorithms; Vehicle routeing problem

Indexed keywords

EID: 34247632955     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1175267177     Document Type: Article

References (13)

1. ALTINKEMER, K. AND GAVISH. B. (1990). Heuristics for delivery problems with constant error guarantees. Transportation Sci. 24, 294-297.
2. ARORA, S. (1996). Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In Proc. 37th Annual Symp. Foundations Comput. Sci., IEEE Computer Society Press, Los Alamitos, CA, pp. 2-11.
3. ASANO, T., KATOH, N., TAMAKI, H. AND TOKUYAMA, T. (1999). Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k. In Proc. STOC '97. ACM, New York, pp. 275-283.
4. BEARDWOOD, J., HALTON, J. L. AND HAMMERSLEY, J. M. (1959). The shortest path through many points. Proc. Camb. Phil. Soc. 55, 299-327.
5. BLUM, A. et al. (1994). The minimum latency problem. In Proc. STOC '94, ACM, New York, pp. 163-171.
6. BOMPADRE, A., DROR, M. AND ORLIN, J. B. (2006). Improved bounds for vehicle routeing solutions. Discrete Optimization 3, 299-316.
7. FEW, L. (1955). The shortest path and the shortest path through n points. Mathematika 2, 141-144.
8. HAIMOVICH, M. AND RINNOOY KAN, A. H. G. (1985). Bounds and heuristics for capacitated routeing problems. Math. Operat. Res. 10, 527-542.
9. HAIMOVICH, M., RINNOOY KAN, A. H. G. AND STOUGIE, L. (1988). Analysis of heuristics for vehicle routing problems. In Vehicle Routing: Methods and Studies, eds B. L. Golden and A. A. Assad, Elsevier, Amsterdam, pp. 47-61.
10. LI, C. L. AND SIMCHI-LEVI, D. (1990). Worst-case analysis of heuristics for the multidepot capacitated vehicle routeing problems. ORSA J. Comput. 2, 64-73.
11. MITCHELL, J. S. B. (1996). Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric k-MST problem. In Proc. 7th ACM-SIAM Symp. Discrete Algorithms, ACM, New York, pp. 402-408.
12. PAPADIMITRIOU, C. H. (1977). The probabilistic analysis of matching heuristics. In Proc. 15th Annual Allerton Conf. Commun. Control Comput., University of Illinois Press, Champaign, IL, pp. 368-378.
13. STOUGIE, L. (1987). Design and Analysis of Algorithms for Stochastic Integer Programming (CWI Tract 37). Stichting Mathematisch Centrum, Amsterdam.