Advertisement

Facility Location Models

  • David Simchi-Levi
  • Xin Chen
  • Julien Bramel
Chapter
Part of the Springer Series in Operations Research and Financial Engineering book series (ORFE)

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.

Keywords

Knapsack Problem Fixed Cost Optimal Objective Function Warehouse Location Retail Location 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. Balinski, M. L. (1965). Integer programming: methods, uses, computation. Management Science, 12, 253–313.MathSciNetCrossRefMATHGoogle Scholar
  2. Barcelo, J., & Casanovas, J. (1984). A heuristic Lagrangian algorithm for the capacitated plant location problem. European Journal of Operational Research, 15, 212–226.CrossRefMATHGoogle Scholar
  3. 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.CrossRefMATHGoogle Scholar
  4. Daskin, M. S. (1995). Network and discrete location: models algorithms and applications. New York: Wiley.CrossRefMATHGoogle Scholar
  5. 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.CrossRefMATHGoogle Scholar
  6. 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.MATHGoogle Scholar
  7. Kuehn, A. A., & Hamburger, M. J. (1963). A heuristic program for location warehouses. Management Science, 9, 643–666.CrossRefGoogle Scholar
  8. Manne, A. S. (1964). Plant location under economies of scale—decentralization and computation. Management Science, 11, 213–235.CrossRefGoogle Scholar
  9. Mirchandani, P. B., & Francis, R. L. (1990). Discrete location theory. New York: Wiley.MATHGoogle Scholar
  10. Nauss, R. M. (1976). An efficient algorithm for the 0-1 knapsack problem. Management Science, 23, 27–31.Google Scholar
  11. 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.MATHGoogle Scholar
  12. Pirkul, H. (1987). Efficient algorithms for the capacitated concentrator location problem. Computers and Operations Research, 14, 197–208.CrossRefMATHGoogle Scholar
  13. Pirkul, H., & Jayaraman, V. (1996). Production, transportation and distribution planning in a multi-commodity tri-echelon system. Transportation Science, 30, 291–302.CrossRefMATHGoogle Scholar
  14. Weber, A. (1909). In C. J. Friedrich (Ed. and transl.) Theory of the location of industries. Chicago: Chicago University Press.Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • David Simchi-Levi
    • 1
  • Xin Chen
    • 2
  • Julien Bramel
    • 3
  1. 1.Massachusetts Institute of TechnologyCambridgeUSA
  2. 2.University of Illinois at Urbana-ChampaignUrbanaUSA
  3. 3.Pine River Capital ManagementNew YorkUSA

Personalised recommendations