Skip to main content
SpringerLink
Log in

Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick

  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Zusammenfassung

Es wird ein Überblick über die in der Literatur behandelten Modelle zur Bestimmung von betrieblichen und innerbetrieblichen Standorten gegeben. Für die meisten Modelle werden exakte und/oder heuristische Lösungsverfahren beschrieben.

Summary

This paper presents a survey of plant-location and plant-layout models discussed in the literature. For most of the models exact and/or heuristic solution methods are described.

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

Abbreviations

ℝ:

Menge der reellen Zahlen

ℝ+ :

Menge der nichtnegativen reellen Zahlen

ℤ+ :

Menge der nichtnegativen ganzen Zahlen

GE:

Geldeinheiten

LE:

Längeneinheiten

ME:

Mengeneinheiten

N=(V,E,c,t) :

Netzwerk

V :

Knotenmenge

E :

Kantenoder Pfeilmenge

c :

Kantenbewertung (zumeist Transportoder Lagerhaltungskosten)

t :

Knotenbewertung: ME, die zu (von) einem Ort (weg)transportiert werden müssen (Kap. 3 u. 4.1) bzw. Kosten, die pro LE für die notwendigen Transporte entstehen (Kap. 4.2)

d(x,y), d ij :

kürzeste Entfernung zwischen zwei Punktenx undy (bzw.i undj)

p :

zu bestimmende Anzahl an Standorten (Kap. 3 u. 4.1); Anzahl der neu zu installierenden Maschinen (Kap. 4.2)

¯p :

Anzahl der potentiellen Standorte

f :

Fixkosten für potentielle Standorte

b :

Kapazitätsbeschränkung für potentielle Standorte

bm :

Anzahl der Orte, von denen eine Unternehmung Rohstoffe bezieht (Kap. 3)

n :

Anzahl der Orte, an denen eine Unternehmung Produkte absetzt (Kap. 3); Anzahl der Orte, von denen eine Unternehmung Rohstoffe bezieht bzw. an denen sie Produkte absetzt (Kap. 4.1); Anzahl der alten Maschinen (Kap. 4.2)

z :

Zielfunktionswert

JE:

The Journal of Industrial Engineering

MS:

Management Science

NR:

Naval Research Logistics Quarterly

OR:

Operations Research

Literaturverzeichnis

  • Armour, G. C., andE. S. Buffa: A heuristic algorithm and simulation approach to relative location of facilities. MS9, 294–309, 1963.

    Google Scholar 

  • Bindschedler, A. E., andJ. M. Moore: Optimal location of new machines in existing plant layouts. JE12, 41–48, 1961.

    Google Scholar 

  • Bloech, J.: Optimale Industriestandorte, Würzburg-Wien 1970.

  • Buffa, E. S., G. C. Armour, andT. E. Vollmann: Allocating facilities with CRAFT. Harvard Business Review42, 136–156, 1964.

    Google Scholar 

  • Burkard, R. E.: Die Störungsmethode zur Lösung quadratischer Zuordnungsprobleme. Operations Research-Verfahren16, 84–108, 1973.

    Google Scholar 

  • Burkard, R. E., undA. Gerstl: Quadratische Zuordnungsprobleme III: Testbeispiele und Rechenzeiten. Bericht Nr. 85 des Rechenzentrums Graz, August 1973.

  • Cabot, A. V., R. L. Francis, andM. A. Stary: A network flow solution to a rectilinear distance facility location problem. AIIE-Transact.2, 132–141, 1970.

    Google Scholar 

  • Cooper, L.: The transportation-location problem. OR20, 94–108, 1972.

    Google Scholar 

  • Davis, P. S., andT. L. Ray: A branch-bound algorithm for the capacitated facilities location problem. NR16, 331–344, 1969.

    Google Scholar 

  • Dearing, P. M., andR. L. Francis: A network flow solution to a multifacility minimax location problem involving rectilinear distances. Transportation Science8, 126–141, 1974.

    Google Scholar 

  • Domschke, W.: Two new algorithms for minimal cost flow problems. Computing11, 275–285, 1973.

    Google Scholar 

  • -: Verfahren zur Bestimmung optimaler Betriebs- und Lagerstandorte. In:E. Bahke (Hrsg.): Materialflußsysteme, Bd. II. Kapitel 5, Mainz 1975.

  • -: Graphentheoretische Verfahren und ihre Anwendungen zur Lösung von Zuordnungs- und Standortproblemen. Erscheint in Meisenheim/Glan 1976.

  • Domschke, W., andW. Stahl: A solution method for a rectilinear distance facility location problem. Discussion Paper Nr. 40 des Instituts für Wirtschaftstheorie und OR der Universität Karlsruhe, September 1974.

  • Drysdale, J. K., andP. J. Sandiford: Heuristic warehouse location — a case history using a new method. Can. Oprl. Res. Soc.-Journal7, 45–61, 1969.

    Google Scholar 

  • Efroymson, M. A., andT. L. Ray: A branch-bound algorithm for plant location. OR14, 361–368, 1966.

    Google Scholar 

  • Eilon, S., C. D. T. Watson-Gandy, andN. Christofides: Distribution Management: Mathematical modelling and practical analysis. London 1971.

  • Feldman, E., F. A. Lehrer, andT. L. Ray: Warehouse location under continuous economies of scale. MS12, 670–684, 1966.

    Google Scholar 

  • Francis, R. L.: A note on the optimum location of new machines in existing plant layouts. JE14, 57–59, 1963.

    Google Scholar 

  • Francis, R. L., andJ. M. Goldstein: Location theory: A selective bibliography. OR22, 400–410, 1974.

    Google Scholar 

  • Francis, R. L., andJ. A. White: Facility layout and location: An analytical approach. Englewood Cliffs 1974.

  • Gaschütz, G. K., andJ. H. Ahrens: Suboptimal algorithms for the quadratic assignment problem. NR15, 49–62, 1968.

    Google Scholar 

  • Gavett, J. W., andN. V. Plyter: The optimal assignment of facilities to locations by branch and bound. OR14, 210–232, 1966.

    Google Scholar 

  • Goldman, A. J.: Optimal locations for centers in a network. Transportation Science3, 352–360, 1969.

    Google Scholar 

  • Hakimi, S. L.: Optimum locations of switching centers and the absolute centers and medians of a graph. OR12, 450–459, 1964.

    Google Scholar 

  • —: Optimum distribution of switching centers in a communication network and some related graph theoretic problems. OR13, 462–475, 1965.

    Google Scholar 

  • Hakimi, S. L., andS. N. Maheshwari: Optimum locations of centers in networks. OR20, 967–973, 1972.

    Google Scholar 

  • Hillier, F. S.: Quantitative tools for plant layout analysis. JE14, 33–40, 1963.

    Google Scholar 

  • Hillier, F. S., andM. M. Connors: Quadratic assignment problem algorithms and the location of indivisible facilities. MS13, 42–57, 1966.

    Google Scholar 

  • Khalil, T. M.: Facilities relative allocation technique (FRAT). Int. J. Prod. Res.11, 183–194, 1973.

    Google Scholar 

  • Khumawala, B. M.: An efficient branch and bound algorithm for the warehouse location problem. MS18, B 718-B 731, 1972.

    Google Scholar 

  • Kiehne, R.: Innerbetriebliche Standortprobleme und Raumzuordnung. Wiesbaden 1969.

  • Kuehn, A. A., andM. J. Hamburger: A heuristic program for locating warehouses. MS9, 643–666, 1963.

    Google Scholar 

  • Kuenne, R. E., andR. M. Soland: Exact and approximate solutions to the multisourceWeber problem. Math. Programming3, 193–209, 1972.

    Google Scholar 

  • Kuhn, H. W.: Locational problems and mathematical programming. Colloquium on Applications of Mathematics to Economics, Budapest 1963, Hrsg.A. Prékopa, 235–242, Budapest 1965.

  • —: A note onFermat's problem. Math. Programming4, 98–107, 1973.

    Google Scholar 

  • Kuhn, H. W., andR. E. Kuenne: An efficient algorithm for the numerical solution of the generalizedWeber problem in spatial economics. Journal of Regional Science4, 21–33, 1962.

    Google Scholar 

  • Lee, R. C., andJ. M. Moore:Corelap-computerized relationship layout planning. JE18, 195–200, 1967.

    Google Scholar 

  • Levy, J.: An extended theorem for location on a network. Oprl. Res. Quartl.18, 433–442, 1967.

    Google Scholar 

  • Love, R. F.: Locating facilities in three-dimensional space by convex programming. NR23, 503–516, 1969.

    Google Scholar 

  • —: The dual of a hyperbolic approximation to the generalized constrained multi-facility location problem withl p distances. MS21, 22–33, 1974.

    Google Scholar 

  • Love, R. F., andS. A. Kraemer: A dual decomposition method for minimizing transportation costs in multi-facility location problems. Transportation Science7, No. 4, 1973.

  • Love, R. F., andJ. G. Morris: Solving constrained multifacility location problems involvinglp distances using convex programming. Erscheint in OR23, 1975.

  • Lüder, K.: Standortwahl; Verfahren zur Planung betrieblicher und innerbetrieblicher Standorte. In:H. Jacob (Hrsg.): Industriebetriebslehre in programmierter Form. Bd. I: Grundlagen. S. 41 bis 115, Wiesbaden 1972.

  • Manne, A. S.: Plant location under economies-of-scale — decentralization and computation. MS11, 213–235, 1964.

    Google Scholar 

  • Maranzana, F. E.: On the location of supply points to minimize transport costs. Oprl. Res. Quartl.15, 261–270, 1964.

    Google Scholar 

  • Marks, D. H., andJ. C. Liebman: Mathematical analysis of solid waste collection. Research Grant EC-00309, Johns Hopkins University 1970.

  • Miehle, W.: Link-length minimization in networks. OR6, 232–243, 1958.

    Google Scholar 

  • Moore, J. M.: Optimal locations for multiple machines. JE12, 307–313, 1961.

    Google Scholar 

  • —: Computer aided facilities design: An international survey. Int. J. Prod. Res.12, 21–44, 1974.

    Google Scholar 

  • Morris, J. G.: A linear programming approach to the solution of constrained multi-facility minimax location problems where distances are rectangular. Oprl. Res. Quartl.24, 419–435, 1973.

    Google Scholar 

  • Nugent, C. E., T. E. Vollmann, andJ. Ruml: An experimental comparison of techniques for the assignment of facilities to locations. OR16, 150–173, 1968.

    Google Scholar 

  • Pierce, J. F., andW. B. Crowston: Tree-search algorithms for quadratic assignment problems. NR18, 1–36, 1971.

    Google Scholar 

  • Pritsker, A. A. B., andP. M. Ghare: Locating new facilities with respect to existing facilities. AIIE-Transact.2, 290–297, 1970.

    Google Scholar 

  • Rao, M. R.: On the direct search approach to the rectilinear facilities location problem. AIIE-Transact.5, 256–264, 1973.

    Google Scholar 

  • Rech, P., andL. G. Barton: A non-convex transportation algorithm. In:E. Beale (Ed.): Applications of mathematical programming techniques. English Universities Press, London 1971.

    Google Scholar 

  • Reiter, S., andG. R. Sherman: Allocating indivisible resources affording external economies or diseconomies. Int. Econ. Rev.3, 108–135, 1962.

    Google Scholar 

  • ReVelle, C., D. Marks, andJ. C. Liebman: An analysis of private and public sector location models. MS16, 692–707, 1970.

    Google Scholar 

  • Seehof, J. M., andW. O. Evans: Automated layout design program. JE18, 690–695, 1967.

    Google Scholar 

  • Spielberg, K.: Algorithms for the simple plant-location problem with some side conditions. OR17, 85–111, 1969.

    Google Scholar 

  • Stevens, B. H., andC. A. Brackett: Industrial location: A review and annotated bibliography of theoretical, empirical, and case studies. Bibliography Series No. 3, Regional Science Research Institute, Philadelphia 1967.

    Google Scholar 

  • Teitz, M. B., andP. Bart: Heuristic methods for estimating the generalized vertex median of a weighted graph. OR16, 955–961, 1968.

    Google Scholar 

  • Vergin, R. C., andJ. D. Rogers: An algorithm and computational procedure for locating economic facilities. MS13, B 240-B 254, 1967.

    Google Scholar 

  • Vollmann, T. E., C. E. Nugent, andR. L. Zartler: A computerized model for office layout. JE19, 321–327, 1968.

    Google Scholar 

  • Weber, A.: Über den Standort der Industrien. 1. Teil: Reine Theorie des Standortes. Tübingen 1909.

  • Wesolowsky, G. O., andR. F. Love: The optimal location of new facilities using rectangular distances. OR19, 124–130, 1971.

    Google Scholar 

  • Witten, P.: Distributionsmodelle. Planungsansätze und Lösungsverfahren für Transport- und Lagerprobleme. Göttingen 1974.

Download references

Author information

Authors and Affiliations

  1. Institut für Wirtschaftstheorie und Operations Research der Universität Karlsruhe, Kaiserstr. 12, D-75, Karlsruhe 1

    W. Domschke

Authors
  1. W. Domschke
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Domschke, W. Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick. Zeitschrift für Operations Research 19, B13–B41 (1975). https://doi.org/10.1007/BF01963926

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01963926

Search

Navigation