Summary
This paper considers the following assignment problem. There are some groups of plants, each group producing a different commodity. There are some consumption areas, each containing a number of storehouses and wanting a certain amount of all the commodities. The problem consists of finding the assignment of storehouses to plants which minimizes the overall cost, consisting of fixed charges associated to all storehouses and plants, and of transportation costs. For the solution of this problem, which can be called a plant-storehouse location problem, two algorithms are presented. The first algorithm makes use of a branch and bound technique; the second is based on a decomposition technique, which follows directly from the Dynamic Programming.
The classic plant location problem is a particular case of the problem discussed in this paper.
Zusammenfassung
In dieser Arbeit wird folgendes Zuordnungsproblem untersucht. Gegeben sind einige Fabrikgruppen, die jeweils verschiedene Waren herstellen, und einige Verbrauchsgebiete mit jeweils einer Anzahl von Lägern und einem bestimmten Bedarf an diesen Waren. Gesucht ist eine gesamtkostenminimale Zuordnung der Läger zu den Fabriken. Die Gesamtkosten setzen sich aus den Transportkosten und „fixed charges“ für jede Fabrik und jedes Lager zusammen. Für dieses spezielle Standortproblem werden zwei Algorithmen entwickelt. Während der erste Algorithmus auf der „Branch and Bound“-Technik aufbaut, basiert der zweite auf einer aus der dynamischen Optimierung entwickelten Dekompositionstechnik.
Das klassische Standorproblem ist ein Sonderfall des in dieser Arbeit behandelten Problems.
Similar content being viewed by others
References
Balinski, M. L.: On Finding Integer Solution to Linear Programs, Mathematica, Princeton, N. J., May 1964.
Biondi, E., F. Brioschi, L. Divieti, andP. Rozzoni: Structures of Multistage Decision Processes, Identificazione e Ottimizzazione, C. N. R., Roma, 1967, pp. 325 – 344 (in italian).
Biondi, E., L. Divieti, C. Roveda, andR. Schmid: Optimal Solution for a Class of Assignment and Transportation Problems, presented at 2° SIAM Conference on Computing Methods in Optimization Problems, Sanremo, Italy, Sept. 1968, and to be published in the Proceedings.
Efroymson, M. A. andT. L. Ray: A Branch-Bound Algorithm for Plant Location. Operations Research.14, 1966, pp. 361–368.
Feldman, E., F. Lehrer, andT. L. Ray: Warehouse Location under Continous Economies of Scale, Management Science,12, 1966, pp. 670–684.
Kühn, A. A. andM. J. Hamburger: A Heuristic Program for Locating Warehouses, Management Sci.,10, 1963, pp. 643–666.
Land, A. H. andA. Doig: An Automatic Method of Solving Discrete Programming Problems, Econometrica,28, 1960, pp. 497–520.
Manne, A. S.: Plant Location under Economies-of-Scale-Decentralization and Computation, Management Sci.,11, 1964, pp. 213–235.
Spielberg, K.: Algorithms for the Simple Plant Location Problem with Some Side Conditions, Operations Research,17, 1969, pp. 85–111.
Additional information
Deutsche Übersetzung:Zwei Algorithmen zur Lösung von Fabrik-Lagerhaus-Standortproblemen.
This work has been supported by Consiglio Nazionale delle Ricerche (C. N. R.), Roma, Italy.
The authors are with the Istituto di Elettrotecnica ed Elettronica, Laboratorio di Controlli Automatici, Politecnico di Milano, Milano, Italy.
Rights and permissions
About this article
Cite this article
Roveda, C., Schmid, R. Two algorithms for a plant-storehouse location problem. Unternehmensforschung Operations Research 15, 30–44 (1971). https://doi.org/10.1007/BF01939809
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01939809