Skip to main content
SpringerLink
Log in
Book cover

International Conference on Optimization Problems and Their Applications

OPTA 2018: Optimization Problems and Their Applications pp 29–41Cite as

Branch and Bound Method for the Weber Problem with Rectangular Facilities on Lines in the Presence of Forbidden Gaps

  • Conference paper
  • First Online:

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 871))

Abstract

The problem of location of connected rectangular facilities on parallel lines in the presence of forbidden gaps is studied. The rectangular metric is used. The centers of the placed facilities are connected with the centers of the gaps. The facilities are impossible to place in forbidden gaps. It is necessary to place the facilities on the lines so that the total cost of connections between the facilities and between facilities and gaps was minimized. The problem is an adequate model of many practical situations. It is known that the original continuous problem for one–line variant is reduced to discrete subproblems. In this paper, the review of the properties and the algorithms for solving of the problem on one line are described. The branch and bound method for solving the problem is proposed. Results of computational experiments on comparison of the branch and bound method and a heuristic proposed in [27] are reported. In the experiments, a integer programming model and IBM ILOG CPLEX package are used.

G. G. Zabudsky—The work was supported by the program of fundamental scientific research of the SB RAS No. I.5.1., project No. 0314-2016-0019.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Bischoff, M., Klamroth, K.: An efficient solution method for Weber problems with barriers based on genetic algorithms. Eur. J. Oper. Res. 177, 22–41 (2007)

    Article  MathSciNet  Google Scholar 

  2. Butt, S.E., Cavalier, T.M.: Facility location in the presence of congested regions with the rectilinear distance metric. Socio-Econom. Plan. Sci. 31, 103–113 (1997)

    Article  Google Scholar 

  3. Cabot, A.V., Francis, R.L., Stary, M.A.: A network flow solution to a rectilinear distance facility location problem. AIIE Trans. II(2), 132–141 (1970)

    Article  Google Scholar 

  4. Erzin, A.I., Cho, J.D.: Concurrent placement and routing in the design of integrated circuits. Autom. Remote Control 64(12), 1988–1999 (2003)

    Article  MathSciNet  Google Scholar 

  5. Foulds, L.R., Hamacher, H.W., Wilson, J.M.: Integer programming approaches to facilities layout models with forbidden areas. Ann. Oper. Res. 81, 405–417 (1998)

    Article  MathSciNet  Google Scholar 

  6. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979). Mir, Moscow (1982)

    Google Scholar 

  7. Kacprzyk, J., Stanczak, W.: Discrete approximation of the Weber problem with the Euclidean distance (in Polish). Applicationes Mathematicae XVIII, 257–270 (1984)

    Article  Google Scholar 

  8. Kafer, B., Nickel, S.: Error bounds for the approximative of restricted planar location problems. Eur. J. Oper. Res. 135, 67–85 (2001)

    Article  MathSciNet  Google Scholar 

  9. Katz, N., 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. 6, 166–173 (1981)

    Article  MathSciNet  Google Scholar 

  10. Klamroth, K.: Single-Facility Location Problems with Barriers. Springer Series in Operations Research. Springer, New York (2002). https://doi.org/10.1007/b98843

    Book  MATH  Google Scholar 

  11. Kochetov, Yu.A., Panin, A.A., Plyasunov, A.V.: Comparison of metaheuristics for the bilevel facility location and mill pricing problem. Diskret. Anal. Issled. Oper. 22(3), 36–54 (2015)

    Article  MathSciNet  Google Scholar 

  12. Kuhn, H.W.: A note on Fermat’s problem. Math. Program. 4, 98–107 (1973)

    Article  MathSciNet  Google Scholar 

  13. Nickel, S., Puerto, J.: Location Theory: A Unified Approach. Springer, Heidelberg (2005). https://doi.org/10.1007/3-540-27640-8

    Book  MATH  Google Scholar 

  14. Legkih, S.A., Nagornay, Z.E., Zabudsky, G.G.: Automation of design of plans of production sites and shops of the sewing enterprises (in Russian). Nat. Tech. Sci. 4, 261–266 (2005)

    Google Scholar 

  15. Love, R.F., Wong, J.Y.: On solving a one-dimentional space allocation problem with integer programming. INFORR 14(2), 139–143 (1976)

    MATH  Google Scholar 

  16. McGarvey, R.G., Cavalier, T.M.: Constrained location of competitive facilities in the plane. Comput. Oper. Res. 32, 539–378 (2005)

    Article  MathSciNet  Google Scholar 

  17. Panyukov, A.V.: The problem of locating rectangular plants with minimal cost for the connecting network. Diskret. Anal. Issled. Oper. Ser. 2 8(1), 70–87 (2001)

    MathSciNet  MATH  Google Scholar 

  18. Panyukov, A.V., Shangin, R.E.: Algorithm for the discrete Weber’s problem with an accuracy estimate. Autom. Remote Control 77(7), 1208–1215 (2016)

    Article  MathSciNet  Google Scholar 

  19. Picard, J.C., Ratliff, D.H.: A cut approach to the rectilinear distance facility location problem. Oper. Res. 26(3), 422–433 (1978)

    Article  MathSciNet  Google Scholar 

  20. Rudnev, A.S.: Probabilistic tabu search algorithm for the packing circles and rectangles into the strip. Diskret. Anal. Issled. Oper. 16(4), 61–86 (2009)

    MATH  Google Scholar 

  21. Simmons, D.M.: One-dimensional space allocation: an ordering algorithm. Oper. Res. 17(5), 812–826 (1969)

    Article  MathSciNet  Google Scholar 

  22. Chen, W.-K.: The VLSI Handbook. CRC Press, Boca Raton (2000)

    Google Scholar 

  23. Zabudsky, G.G.: On the problem of the linear ordering of vertices of parallel-sequential graphs. Diskret. Anal. Issled. Oper. 7(1), 61–64 (2000)

    MathSciNet  Google Scholar 

  24. Zabudskii, G.G., Amzin, I.V.: Algorithms of compact location for technological equipment on parallel lines (in Russian). Sib. Zh. Ind. Mat. 16(3), 86–94 (2013)

    MathSciNet  MATH  Google Scholar 

  25. Zabudsky, G.G., Legkih, S.A.: Mathematical model of optimization of flexible modules of processing equipment (in Russian). Appl. Math. Inf. Technol. 20–28 (2005)

    Google Scholar 

  26. Zabudsky, G., Veremchuk, N.: About local optimum of the Weber problem on line with forbidden gaps. In: Proceedings of the DOOR 2016, Vladivostok, Russia, 19–23 September 2016, vol. 1623, pp. 115–124. CEUR-WS (2016). CEUR-WS.org. http://ceur-ws.org/Vol-1623/paperco17.pdf

  27. Zabudskii, G.G., Veremchuk, N.S.: An algorithm for finding an approximate solution to the Weber problem on a line with forbidden gaps. J. Appl. Ind. Math. 10(1), 136–144 (2016)

    Article  MathSciNet  Google Scholar 

  28. Zabudsky, G.G., Veremchuk, N.S.: Solving Weber problem on plane with minimax criterion and forbidden gaps (in Russian). IIGU Ser. Matematika 9, 10–25 (2014)

    MATH  Google Scholar 

  29. Zabudsky, G., Veremchuk, N.: Weber problem for rectangles on lines with forbidden gaps. In: IEEE Conference 2016 Dynamics of Systems, Mechanisms and Machines, Omsk, 15–17 November 2016 (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Omsk, Russia

    Gennady G. Zabudsky & Natalia S. Veremchuk

Authors
  1. Gennady G. Zabudsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Natalia S. Veremchuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Gennady G. Zabudsky or Natalia S. Veremchuk .

Editor information

Editors and Affiliations

  1. Sobolev Institute of Mathematics SB RAS, Omsk, Russia

    Anton Eremeev

  2. Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia

    Michael Khachay

  3. Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia

    Yury Kochetov

  4. Industrial and Systems Engineering, University of Florida, Gainesville, Florida, USA

    Panos Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zabudsky, G.G., Veremchuk, N.S. (2018). Branch and Bound Method for the Weber Problem with Rectangular Facilities on Lines in the Presence of Forbidden Gaps. In: Eremeev, A., Khachay, M., Kochetov, Y., Pardalos, P. (eds) Optimization Problems and Their Applications. OPTA 2018. Communications in Computer and Information Science, vol 871. Springer, Cham. https://doi.org/10.1007/978-3-319-93800-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-93800-4_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-93799-1

  • Online ISBN: 978-3-319-93800-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation