Skip to main content
SpringerLink
Log in

Search region contraction of the weber problem solution on the plane with rectangular forbidden zones

  • System Analysis and Operations Research
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

There are a lot of fixed objects and rectangular forbidden zones on the plane. It is necessary to arrange on this plane, outside of forbidden zones, objects connected with fixed objects and among themselves. The rectangular metric is used for the measurement of distances. The optimality criterion in the problem is the minimality of the total cost of connections among all objects. The problem property is found that makes it possible to reduce the considered admissible region in the search for the optimal solution. The results of the computational experiment for analysis of the application effectiveness of the stated property are presented.

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. Trubin, V.A., The Effective Algorithm for a Weber Problem with Rectangular Matric, Kibernetika, 1978, no. 6, pp. 67–70.

  2. Issledovanie operatsii. Modeli i ikh primenenie (Operation Research. Models and Their Application), Mowder, J. and Elmaghrabi, S., Eds., Moscow: Mir, 1981.

    Google Scholar 

  3. Bischoff, M. and Klamroth, K., An Efficient Solution Method for Weber Problems with Barriers Based on Genetic Algorithms, Eur. J. Oper. Res., 2007, vol. 177, pp. 22–41.

    Article  MathSciNet  MATH  Google Scholar 

  4. Kafer, B. and Nickel, S., Error Bounds for the Approximative Solution of Restricted Planar Location Problems, Eur. J. Oper. Res., 2001, vol. 135, pp. 67–85.

    Article  MathSciNet  Google Scholar 

  5. Katz, N. and Cooper, L., Facility Location in the Presence of Forbidden Regions, I: Formulation and the Case of Euclidean Distance with one Forbidden Circle, Eur. J. Oper. Res., 1981, vol. 6, pp. 166–173.

    Article  MathSciNet  MATH  Google Scholar 

  6. Butt, S.E. and Cavalier, T.M., Facility Location in the Presence of Congested Regions with the Rectilinear Distance Metric, Socio-Econom. Planning Sci., 1997, vol. 31, pp. 103–113.

    Article  Google Scholar 

  7. McGarvey, R.G. and Cavalier, T.M., Constrained Location of Competitive Facilities in the Plane, Comput. Oper. Res., 2005, vol. 32, pp. 359–378.

    Article  MathSciNet  MATH  Google Scholar 

  8. Zabudskii, G.G., Model Building and Location Problem Solving in a Plane with Forbidden Gaps, Autom. Remote Control, 2006, vol. 67, no. 12, pp. 1986–1990.

    Article  MathSciNet  MATH  Google Scholar 

  9. Nickel, S. and Puerto, J., Location Theory. A Unified Approach, Berlin: Springer, 2005.

    MATH  Google Scholar 

  10. Preparata, F.P. and Shamos, M.I., Computational Geometry: An Introduction, New York: Springer, 1985. Translated under the title Vychislitel’naya geometriya: vvedenie, Moscow: Mir, 1989.

    Google Scholar 

  11. Stoyan, Yu.G. and Yakovlev, S.V., Matematicheskie modeli i optimizatsionnye metody geometricheskogo proektirovaniya (Mathematical Models and Optimization Methods of Geometric Design), Kiev: Naukova Dumka, 1986.

    Google Scholar 

  12. Cabot, A.V., Francis, R.L., and Stury, M.A., A Network Flow Solution to a Rectilinear Distance Facility Location Problem, AIIE Trans., 1970, vol. 2, no. 2, pp. 132–141.

    Article  Google Scholar 

  13. Picard, J.C. and Ratliff, H.D., A Cut Approach to the Rectilinear Distance Facility Location Problem, Oper. Res., 1978, vol. 26, no. 3, pp. 422–433.

    Article  MathSciNet  MATH  Google Scholar 

  14. Zabudskii, G.G., A Minimax Planar Location Problem with Forbidden Zones: Its Solution Algorithm, Autom. Remote Control, 2004, vol. 65, no. 2, pp. 241–247.

    Article  MathSciNet  MATH  Google Scholar 

  15. Zabudskii, G.G. and Amzin, I.V., Algorithms of the Weber Problem Solution on a Plane in the Rectangular Metric with Forbidden Zones, in Methods of Optimization and Their Application: Proc. XIV Baikal. Workshop, 2008, vol. 1, pp. 370–379.

    Google Scholar 

  16. Zabudskii, G.G., The Weber Problem Solution on a Plane with Forbidden Zones, Vestn. Tyumen. Univ., 2006, no. 5, pp. 173–178.

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Omsk, Russia

    G. G. Zabudskii

  2. Dostoevskii State University, Omsk, Russia

    I. V. Amzin

Authors
  1. G. G. Zabudskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. V. Amzin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © G.G. Zabudskii, I.V. Amzin, 2012, published in Avtomatika i Telemekhanika, 2012, No. 5, pp. 71–83.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zabudskii, G.G., Amzin, I.V. Search region contraction of the weber problem solution on the plane with rectangular forbidden zones. Autom Remote Control 73, 821–830 (2012). https://doi.org/10.1134/S0005117912050062

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation