In cases where certain simplifications are allowed, the location optimisation of given and indivisible different economic units may be modelled as a bi-value weighted distribution problem. The paper presents a heuristic algorithm for this network-flow-type problem and also a partial enumeration algorithm for deriving the exact solution. But it is also pointed out that an initial sub-optimal solution can quickly be improved with a derivation on a direct line only, if the exact solution is not absolutely essential. A numerical example is used to illustrate the method of derivation on a direct line starting with an upper bound given by a sub-optimal solution.
Get full access to this article
View all access options for this article.
References
1.
BalasE., 1965, “An additive algorithm for solving linear programs with zero-one variables”, Operations Research, 13, 517–546.
2.
BalasE., 1967, “Discrete programming by the filter method”, Operations Research, 15, 915–957.
3.
BeckmannM.KünziH. P., 1968, Lecture Notes in Operations Research and Mathematical Economics: Volume 4, Einführung in die Methode Branch and Bound (Springer-Verlag, Berlin).
4.
BergeC., 1964, The Theory of Graphs and Its Applications (John Wiley, New York).
5.
BertierP.RoyB., 1964, “Procedure de resolution pour une classe de problèmes pouvant avoir un caractère combinatoire”, Cahiers du Centre d'Etude des Recherche Operationnelle, Brussels, 6, 202–208.
6.
BusackerR. G.SaatyT. L., 1965, Finite Graphs and Networks (McGraw-Hill, New York).
7.
FordL. K.FulkersonD. K., 1962, Flows in Networks (Princeton University Press, Princeton, USA).
8.
HadleyG., 1962, Linear Programming (Addison-Wesley, Reading, Mass., USA).
9.
JándyG., 1965, “Telepitési operációkutatás a regionális tervezésben és az épitiparban” (Report in Hungarian), SZÁMGÉP, Budapest, Hungary.
10.
JándyG., 1966, Szállitási és telepitési operációkutatás (Operations Research in Transport and Location, in Hungarian) (Müszaki Könyvkiadó, Budapest).
11.
JándyG., 1967a, “Különböz funkcióju, adott és oszthatatlan gazdasági, egységek telepités-optimálása” (Report in Hungarian), SZÁMGÉP, Budapest, Hungary.
JándyG. (in preparation) Operációkutatás a kapacitások területi tervezésében (Operations Research in Spatial Planning and Control of Capacities, in Hungarian) (Müsaki Könyvkiadó, Budapest).
14.
KönigD., 1936, Theorie der endlichen und unendlichen Graphen (Akademische Verlagsgesellschaft, Leipzig).
