Skip to main content
SpringerLink
Log in

Uniform capacitated facility location problem with random input data

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

We consider the capacitated facility location problem with uniform capacitates and specific demand restrictions. Entries of the cost matrix (g ij ) are assumed to take random values according to discrete uniform distribution. We propose an approximation algorithm for solving this problem and analyze its work from the probabilistic point of view. A key role in this algorithm is played by the procedure of finding the perfect matching in a graph with random edges. We find conditions for the asymptotic exactness of the algorithm with time complexity O(n lnm), where n is the number of clients and m is the number of facilities. Bibliography: 10 titles. Illustrations: 5 figures.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco (1979).

    MATH  Google Scholar 

  2. I. P. Voznyuk, E. H. Gimadi, and M. Yu. Filatov, “An asymptotically exact algorithm for solving the location problem with restrictions on producing capacity” [in Russian], Diskretn. Anal. Issled. Oper. 8, No. 2, 3–16 (2001).

    MathSciNet  MATH  Google Scholar 

  3. A. A. Ageev, E. H. Gimadi, and A. A. Kurochkin, “A polynomial algorithm for solving the facility location problem on a chain network with identical plant production capacities” [in Russian], Diskretn. Anal. Issled. Oper. 16, No. 5, 3–18 (2009). 16, No. 5, 3–18 (2009).

    MathSciNet  Google Scholar 

  4. E. H. Gimadi, “An efficient algorithm for the solution of the location problem with service domains connected with respect to an acyclic network” [in Russian], Upr. Sist. No. 23, 12–23 (1983).

  5. T. Tokuyama and J. Nakano, “Efficient algorithms for the hitchcock transportation problem,” In: Symposium on Discrete Algorithms: Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms. Orlando, Florida, United States, pp. 175–184 (1992).

  6. P. Kleinschmidt and H. Schannath, “A strongly polynomial algorithm for the transportation problem,” Math. Program., No. 68, 1–13 (1995).

    Google Scholar 

  7. D. Angluin and L. G. Valiant, “Fast probabilistic algorithms for Hamiltonian circuits and matchings,” J. Comput. Syst. Sci. 18, No. 2, 155–193 (1979).

    Article  MathSciNet  MATH  Google Scholar 

  8. E. H. Gimadi and V. A. Perepelica, “An asymptotic approach to the solution of the travelling salesman problem” [in Russian], Upr. Syst. No. 12, 35–45 (1974).

  9. A. A. Borovkov, Probability Theory [in Russian], Nauka, Moscow (1986); English transl.: Gordon and Breach, Abingdon etc. (1998).

    Google Scholar 

  10. V. V. Petrov, Limit Theorems of Probability Theory. Sequences of Independent Random Variables [in Russian], Nauka, Moscow (1987); English transl.: Clarendon Press, Oxford (1995).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics SB RAS, 4, pr. Akad. Koptyuga, Novosibirsk, 630090, Russia

    E. Kh. Gimadi & A. A. Kurochkin

  2. Novosibirsk State University, 2, ul. Pirogova, Novosibirsk, 630090, Russia

    E. Kh. Gimadi

Authors
  1. E. Kh. Gimadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. A. Kurochkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. Kh. Gimadi.

Additional information

Translated from Vestnik Novosibirskogo Gosudarstvennogo Universiteta: Seriya Matematika, Mekhanika, Informatika 11, No. 1, 2011, pp. 15-34

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gimadi, E.K., Kurochkin, A.A. Uniform capacitated facility location problem with random input data. J Math Sci 188, 359–377 (2013). https://doi.org/10.1007/s10958-012-1134-3

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-012-1134-3

Keywords

Search

Navigation