Skip to main content

Facility Location Models

  • Chapter
  • First Online:
The Logic of Logistics

Abstract

One of the most important aspects of logistics is deciding where to locate new facilities such as retailers, warehouses, or factories. These strategic decisions are a crucial determinant of whether materials will flow efficiently through the distribution system.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 99.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

References

  • Balinski, M. L. (1965). Integer programming: methods, uses, computation. Management Science, 12, 253–313.

    Article  MathSciNet  MATH  Google Scholar 

  • Barcelo, J., & Casanovas, J. (1984). A heuristic Lagrangian algorithm for the capacitated plant location problem. European Journal of Operational Research, 15, 212–226.

    Article  MATH  Google Scholar 

  • Cornuéjols, G., Fisher, M. L., & Nemhauser, G. L. (1977). Location of bank accounts to optimize float: an analytical study of exact and approximate algorithms. Management Science, 23, 789–810.

    Article  MATH  Google Scholar 

  • Daskin, M. S. (1995). Network and discrete location: models algorithms and applications. New York: Wiley.

    Book  MATH  Google Scholar 

  • Hakimi, S. L. (1964) Optimum locations of switching centers and the absolute centers and medians of a graph. Mathematics of Operations Research, 12, 450–459.

    Article  MATH  Google Scholar 

  • Klincewicz, J. G., & Luss, H. (1986). A lagrangian relaxation heuristic for capacitated facility location with single-source constraints. Journal of the Operational Research Society, 37, 495–500.

    MATH  Google Scholar 

  • Kuehn, A. A., & Hamburger, M. J. (1963). A heuristic program for location warehouses. Management Science, 9, 643–666.

    Article  Google Scholar 

  • Manne, A. S. (1964). Plant location under economies of scale—decentralization and computation. Management Science, 11, 213–235.

    Article  Google Scholar 

  • Mirchandani, P. B., & Francis, R. L. (1990). Discrete location theory. New York: Wiley.

    MATH  Google Scholar 

  • Nauss, R. M. (1976). An efficient algorithm for the 0-1 knapsack problem. Management Science, 23, 27–31.

    Google Scholar 

  • Neebe, A. W., & Rao, M. R. (1983). An Algorithm for the fixed-charged assigning users to sources problem. Journal of the Operational Research Society, 34, 1107–1113.

    MATH  Google Scholar 

  • Pirkul, H. (1987). Efficient algorithms for the capacitated concentrator location problem. Computers and Operations Research, 14, 197–208.

    Article  MATH  Google Scholar 

  • Pirkul, H., & Jayaraman, V. (1996). Production, transportation and distribution planning in a multi-commodity tri-echelon system. Transportation Science, 30, 291–302.

    Article  MATH  Google Scholar 

  • Weber, A. (1909). In C. J. Friedrich (Ed. and transl.) Theory of the location of industries. Chicago: Chicago University Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this chapter

Cite this chapter

Simchi-Levi, D., Chen, X., Bramel, J. (2014). Facility Location Models. In: The Logic of Logistics. Springer Series in Operations Research and Financial Engineering. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-9149-1_15

Download citation

Publish with us

Policies and ethics