Advertisement

Single Facility Location Problem

  • Esmaeel Moradi
  • Morteza Bidkhori
Chapter
Part of the Contributions to Management Science book series (MANAGEMENT SC.)

Abstract

This chapter will focus on the simplest types of location problems, single facility location problem. These problems occur on a regular basis when working, layout problems (e.g., we may need to locate a machine in a shop, or items inside a warehouse). Also, on a larger scale, they can occur in, say, choosing the location of a warehouse to serve customers to whom goods must be delivered.

The models shall be studied as being “quick and dirty.” They are “quick” in the sense that they can be used quickly and easily, and “dirty” in the send that they are approximate. The use of these models should be considered particularly when some location decision must be made quickly and with limited resource available for decision analysis.

When we wish to locate a single new facility in the plane, we often would like to minimize an objective function involving Euclidean or rectilinear distances between the new facility and a collection of existing facilities having known planar locations. The first objective function we consider is that of total travel distance, or total travel cost.

Keywords

Location Problem Contour Line Facility Location Location Decision Demand Point 
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. Drezner Z (1986) Location of regional facilities. Naval Res Logist Quart 33:523–529CrossRefGoogle Scholar
  2. Francis Rl, White JA (1974) Facility layout and location: An analytical approach. Prentice Hall, Englewood Cliffs, NJGoogle Scholar
  3. Francis Rl, McGinnis LF, White JA (1992) Facility layout and location: An analytical approach. Prentice Hall, Englewood Cliffs, NJGoogle Scholar
  4. Heragu SS (1997) Facilities design. PWS publishing company, a division of International Thomson Publishing Inc. BostonGoogle Scholar
  5. Uster H, Love RF (2000) The convergence of the Weiszfeld algorithm. Management Science/Information Systems AreaGoogle Scholar
  6. Uster H, Love RF (2001) A generalization of the rectangular bounding method for continuous location models. Comput Math Appl 44:181–191CrossRefGoogle Scholar
  7. Zaferanieh M, Taghizadeh KH, Brimberg J, Wesolowsky GO (2008) A BSSS algorithm for the single facility location problem in two regions with different norms. Eur J Oper Res 190(1):79–89CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  1. 1.Department of Industrial EngineeringAmirkabir University of TechnologyTehranIran

Personalised recommendations