Skip to main content
Log in

Stochastic problem of competitive location of facilities with quantile criterion

  • Control in Social Economic Systems, Medicine, and Biology
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

A stochastic problem of facility location formulated as a discrete bilevel problem of stochastic programming with quantile criterion was proposed. Consideration was given there to a pair of competitive players successively locating facilities with the aim of maximizing their profits. For the case of discrete distribution of the random consumer demands, it was proposed to reduce the original problem to the deterministic problem of bilevel programming. A method to calculate the value of the objective function under fixed leader strategy and procedures to construct the upper and lower bounds of the optimal value of the objective function were proposed.

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

  1. Beresnev, V.L., Diskretnye zadachi razmeshcheniya i polinomy bulevykh peremennykh (Discrete Problems of Location and Polynomials of Boolean Variables), Novosibirsk: Inst. Mat., 2005.

    Google Scholar 

  2. Sheppard, E.S., A Conceptual Framework for Dynamic Location–Allocation Analysis, Environ. Planning A., 1974, vol. 6, pp. 547–564.

    Article  Google Scholar 

  3. Ghosh, A. and McLafferty, S.L., Locating Stores in Uncertain Environments: A Scenario Planning Approach, J. Retail, 1982, vol. 58(4), pp. 5–22.

    Google Scholar 

  4. Owen, S.H. and Daskin, M.S., Strategic Facility Location: A Review, Eur. J. Oper. Res., 1998, vol. 111, no. 3, pp. 423–447.

    Article  MATH  Google Scholar 

  5. Snyder, L.V., Facility Location under Uncertainty: A Review, IIE Trans., 2006, vol. 38, no. 7, pp. 547–564.

    Article  Google Scholar 

  6. Kibzun, A.I. and Kan, Y.S., Stochastic Programming Problems with Probability and Quantile Functions, New York: Wiley, 1996.

    MATH  Google Scholar 

  7. Kibzun, A.I. and Kan, Yu.S., Zadachi stokhasticheskogo programmirovaniya s veroyatnostnymi kriteriyami (Problems of Stochastic Programming with Probabilistic Criteria), Moscow: Fizmatlit, 2009.

    Google Scholar 

  8. Chen, G., Daskin, M.S., Shen, Z.-J.M., and Uryasev, S., The a-Reliable Mean-excess Regret Model for Stochastic Facility Location Modeling, Naval Res. Logist., 2006, vol. 5, no. 7, pp. 617–626.

    Article  MathSciNet  MATH  Google Scholar 

  9. Beresnev, V.L., Upper Bounds for Objective Functions of Discrete Competitive Facility Location Problems, J. Appl. Industr. Math., 2009, vol. 3, no. 4, pp. 419–432.

    Article  MathSciNet  Google Scholar 

  10. Beresnev, V.L. and Mel’nikov, A.A., Approximate Algorithms for the Problem of Competitive Location of Facilities, Diskret. Anal. Issled. Oper., 2010, vol. 17, no. 6, pp. 3–10.

    MATH  Google Scholar 

  11. Bard, J.F., Practical Bilevel Optimization: Algorithms and Applications, Dordrecht: Kluwer, 1998.

    Book  MATH  Google Scholar 

  12. Dempe, S., Foundations of Bilevel Programming, Dordrecht: Kluwer, 2002.

    MATH  Google Scholar 

  13. Ivanov, S.V., Bilevel Stochastic Linear Programming Problems with Quantile Criterion, Autom. Remote Control, 2014, vol. 75, no. 1, pp. 107–118.

    Article  MathSciNet  MATH  Google Scholar 

  14. Ivanov, S.V. and Naumov, A.V., Algorithm to Optimize the Quantile Criterion for the Polyhedral Loss Function and Discrete Distribution of Random Parameters, Autom. Remote Control, 2012, vol. 73, no. 1, pp. 105–117.

    Article  MathSciNet  MATH  Google Scholar 

  15. Kibzun, A.I., Naumov, A.V., and Norkin, B.I., On Reducing a Quantile Optimization Problem with Discrete Distribution to a Mixed Integer Programming Problem, Autom. Remote Control, 2013, vol. 74, no. 6, pp. 951–967.

    Article  MathSciNet  MATH  Google Scholar 

  16. Mel’nikov, A.A., Computational Complexity of the Discrete Problem of Competitive Location of Facilities, Diskret. Anal. Issled. Oper., 2014, vol. 21, no. 4, pp. 62–79.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. V. Ivanov.

Additional information

Original Russian Text © S.V. Ivanov, M.V. Morozova, 2016, published in Avtomatika i Telemekhanika, 2016, No. 3, pp. 109–122.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ivanov, S.V., Morozova, M.V. Stochastic problem of competitive location of facilities with quantile criterion. Autom Remote Control 77, 451–461 (2016). https://doi.org/10.1134/S0005117916030073

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117916030073

Keywords

Navigation