Skip to main content
Log in

A Probabilistic Analysis of the Capacitated Facility Location Problem

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

The solution value \(Z_n^*\) of a stochastic version of the capacitated facility location problem is studied. It is shown that, for large numbers of customers n, the value of \(\tfrac{1}{n}Z_n^*\) can be closely approximated by θ, where the constant θ is identified as a function of the parameters of the underlying stochastic model. Furthermore, an extensive probabilistic analysis is performed on the difference \(\tfrac{1}{n}Z_n - \theta\) that includes an exponential inequality on the tail distribution, a classification of the speed of convergence and a central limit theorem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • S. Ahn, C. Cooper, G. Cornuejols, and A. Frieze, "Probabilistic analysis of a relaxation for the k-median problem," Mathematics of Operations Research, vol. 13, pp. 1-31, 1988.

    Google Scholar 

  • K.S. Alexander, "Probability inequalities for empirical processes and a law of the iterated logarithm," The Annals of Probability, vol. 12, pp. 1041-1067, 1984.

    Google Scholar 

  • J. Beardwood, J.H. Halton, and J.M. Hammersley, "The shortest path through many points," Proceedings of the Cambridge Philosophical Society, vol. 55, pp. 299-327, 1959.

    Google Scholar 

  • J.E. Beasley, "Lagrangean heuristics for location problems," European Journal of Operational research, vol. 65, pp. 383-399, 1993.

    Google Scholar 

  • J. Bramel and D. Simchi Levi, The Logic of Logistics, Springer Series in Operations Research, New York, 1997.

    Google Scholar 

  • G. Cornuejols, G.L. Nemhauser, and L.A. Wolsey, "The uncapacitated facility location problem," in Discrete Location Theory, P.B. Mirchandani and R.L. Francis (Eds.), John Wiley: New York, 1990.

    Google Scholar 

  • R.M. Dudley, "Central limit theorems for empirical processes," The Annals of Probability, vol. 6, pp. 899-929, 1978.

    Google Scholar 

  • R.M. Dudley, A Course on Empirical Processes, Springer Lecture Notes in Mathematics (Lectures given at Ecole d'Et´e de Probabilit´es de St. Flour), New York, 1982.

    Google Scholar 

  • M.L. Fisher and D.S. Hochbaum, "Probabilistic analysis of the k-median problem," Mathematics of Operations Research, vol. 5, pp. 27-34, 1980.

    Google Scholar 

  • M.R. Garey and D.S. Johnson, Computers and Intractability, Freeman: New York, 1979.

    Google Scholar 

  • M. Haimovich and A.H.G. Rinnooy Kan, "Bounds and heuristics for capacitated routing problems," Mathematics of Operations Research, vol. 10, pp. 527-542, 1985.

    Google Scholar 

  • R. Hassin and E. Zemel, "Probabilistic analysis of the capacitated transportation problem," Mathematics of Operations Research, vol. 13, pp. 80-89, 1988.

    Google Scholar 

  • D.S. Hochbaum and J.M. Steele, "Steinhaus's geometric location problem for random samples in the plane," Advances of Applied Probability, vol. 14, pp. 56-67, 1982.

    Google Scholar 

  • P.B. Mirchandani, "The p-median problem and generalizations," in Discrete Location Theory, P.B. Mirchandani and R.L. Francis (Eds.), John Wiley: New York, 1990.

    Google Scholar 

  • C.H. Papadimitriou, "Worst-case and probabilistic analysis of a geometric location problem," SIAM Journal on Computing, vol. 10, pp. 542-557, 1981.

    Google Scholar 

  • N. Piersma, "Combinatorial optimization and empirical processes," Ph.D. Thesis, Tinbergen Institute, Amsterdam, The Netherlands, 1993.

    Google Scholar 

  • N. Piersma and H.E. Romeijn, "Parallel machine scheduling: A probabilistic analysis," Naval Research Logistics, vol. 43, pp. 897-916, 1996.

    Google Scholar 

  • D. Pollard, Convergence of Stochastic Processes, Springer Series in Statistics, Springer-Verlag, New York, 1984.

    Google Scholar 

  • W.T. Rhee, "Optimal bin packing with items of random sizes," Mathematics of Operations Research, vol. 13, pp. 140-151, 1988.

  • W.T. Rhee and M. Talagrand, "A concentration inequality for the k-median problem," Mathematics of Operations Research, vol. 14, pp. 189-202, 1989a.

    Google Scholar 

  • W.T Rhee and M. Talagrand, "Optimal bin packing with items of random sizes-II," SIAM Journal on Computing, vol. 18, pp. 139-151, 1989b.

    Google Scholar 

  • W.T Rhee and M. Talagrand, "Optimal bin packing with items of random sizes-III," SIAM Journal on Computing, vol. 18, pp. 473-486, 1989c.

    Google Scholar 

  • R.T. Rockafellar, Convex Analysis, Princeton University Press: Princeton, 1970.

    Google Scholar 

  • R. Sridharan, G. Cornuejols, and J.M. Thizy, "A comparison of heuristics and relaxations for the capacitated plant location problem," European Journal of Operational Research, vol. 50, pp. 280-297, 1991.

    Google Scholar 

  • J.M. Steele, Probability Theory and Combinatorial Optimization, SIAM: Philadelphia, 1997.

    Google Scholar 

  • M. Talagrand, "Sharper bounds for Gaussian and empirical processes," The Annals of Probability, vol. 22, pp. 28-76, 1994.

    Google Scholar 

  • S.A. van de Geer and L. Stougie, "On rates of convergence and asymptotic normality in the multiknapsack problem," Mathematical Programming, vol. 51, pp. 349-358, 1991.

    Google Scholar 

  • V.N. Vapnik and Y.A. Chervonenkis, "Necessary and sufficient conditions for the uniform convergence of means to their expectations," SIAM Journal on the Theory of Probability and its Applications, vol. 26, pp. 532-553, 1981.

    Google Scholar 

  • E. Zemel, "Probabilistic analysis of geometric location problems," Annals of Operations Research, vol. 1, pp. 215-238, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Piersma, N. A Probabilistic Analysis of the Capacitated Facility Location Problem. Journal of Combinatorial Optimization 3, 31–50 (1999). https://doi.org/10.1023/A:1009861004623

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009861004623

Navigation