Despite the long history of the multi-Weber problem and the generalised multi-Weber problem, there is no general optimal method for its solution. This paper has two aims. The first aim is a study of the shape of the objective function of the single and multi-Weber problem. The form of the objective function and the relation of a heuristic to it are critical to the decision to use a heuristic or to seek an optimal solution. The objective function of the multi-Weber problem is shown to be extremely steep in the neighbourhood of the optimal solution, indicating the importance of an optimal rather than heuristic solution. The second aim is a description of a two-step algorithm which, although it cannot guarantee optimality, will frequently terminate optimally and thus appears to be superior to other available heuristics.
Get full access to this article
View all access options for this article.
References
1.
AbramowitzMStegunI A, 1972Handbook of Mathematical Functions (Dover, New York)
2.
AndersonI, 1974A First Course in Combinatorial Mathematics (Clarendon Press, Oxford) pp 57–58
FisherW D, 1958, “On grouping for maximum homogeneity”Journal of the American Statistical Association53789–798
18.
FriedrichC J, 1929Alfred Weber's Theory of the Location of Industries (University of Chicago Press, Chicago, IL)
19.
GarcyM RJohnsonD S, 1979Computers and Intractability: A Guide to the Theory of NP completeness (W H Freeman, New York)
20.
HakimiS L, 1964, “Optimum distribution of switching centers and the absolute centers and medians of a graph”Operations Research12450–459
21.
HakimiS L, 1965, “Optimum distribution of switching centers in a communication network and some related graph theoretic problems”Operations Research13462–475
22.
HallR W, 1988, “Median mean and optimum as facility locations”Journal of Regional Science2865–81
23.
HansenPPeetersDThisseJ-Fr, 1983, “Public facilities location models”, in Analysis of Public Facilities Eds ThisseJ-FrZollerH G (North-Holland, Amsterdam) pp 223–261
24.
HarrisB, 1976, “Speeding up iterative algorithms—the generalised Weber problem”Journal of Regional Science16411–413
25.
HarrisBFarhiADufourJ, 1970, “Experimental investigations of a combinatorial problem”, Institute for Environmental Studies, University of Pennsylvania, Philadelphia, PA
26.
HarrisBFarhiADufourJ, 1972Aspects of a Problem in Clustering (University of Pennsylvania Press, Philadelphia, PA)
27.
HertzD BEddisonR T (Eds), 1964Progress in Operations Research, 2 (John Wiley, New York)
28.
KuenneR ESolandR M, 1972, “Exact and approximate solutions to the multisource Weber problem”Mathematical Programming3193–209
29.
KuhnH W, 1967, “On a pair of dual nonlinear programs”, in Non-linear Programming Ed. AbadieJ (North-Holland, Amsterdam) pp 37–54
30.
KuhnH WKuenneR E, 1962, “An efficient algorithm for the generalised Weber problem in spatial economics”Journal of Regional Science421–33
31.
LaunhardtW, 1882, “Die Bestemmund des zweckmässigsten Standorts einer gewerbliche Anlage”Zeitschrift des Vereins Deutscher Ingenierur pp 106–115
32.
LaundhardtW, 1885Mathematische Begründung der Wolkwirtschaftslehre (Leipzig)
33.
LevyJ, 1967, “An extended theorem for location on a network”Operational Research Quarterly18433–442
34.
LoveR SMorrisJ GWesolowskyG O, 1988Facilities Location: Models and Methods (North-Holland, Amsterdam)
35.
ManneA S, 1964, “Plant location under economies-of-scale—decentralization and computation”Management Sciences11213–235
36.
MaranzanaF E, 1964, “On the location of supply points to minimize transport costs”Operational Research Quarterly15261–270
37.
MiehleW, 1958, “Link-length minimisation in networks”Operations Research6232–243
38.
OstreshL MJr, 1973, “TWAIN”, in Computer Programs for Location-Allocation Problems Eds RushtonGKohlerJ A, Monograph 6, Department of Geography, University of Iowa, Iowa City, IA, pp 15–28
39.
OstreshL MJr, 1975, “An efficient algorithm for solving the two center location-allocation problem”Journal of Regional Science15209–216
40.
OstreshL MJr, 1978a, “Convergence and descent in the Fermat location problem”Transportation Science12152–164
41.
OstreshL MJr, 1978b, “The multifacility location problem: Application and descent theorems”Journal of Regional Science17409–419
42.
PickG, 1909, “Mathematischer Anhang”, in Über den Standort de Industrien: Erster Teil Reine Theorie de Standorts A Weber (J C B Mohr, Tübingen) pp 225–246
43.
RosingK E, 1988a, “A background paper on aspects of the multi-Weber problem”, EGI Discussiestukken 88–3, Economisch-Geografisch Instituut, Erasmus Universiteit Rotterdam, Rotterdam
44.
RosingK E, 1988b, “On finding P central locations in continuous space”, in II Meeting of the Euro Working Group on Locational Analysis Ed. PelegrinB (Publicationes de la Universidad de Sevilla, Sevilla) pp 184–203
45.
RosingK EReVelleC S, 1986, “Optimal clustering”Environment and Planning A181463–1476
46.
RosingK Evan DijkJ J, 1989, “On the correct number of regions in regionalization structures”Environment and Planning B: Planning and Design16469–481
47.
RosingK EHillsmanE LRosing-VogelaarH, 1979a, “The robustness of two common heuristics for the p-median problem”Environment and Planning A11373–380
48.
RosingK EHillsmanE LRosing-VogelaarH, 1979b, “A note comparing optimal and heuristic solutions to the p-median problem”Geographical Review1186–89
49.
SimpsonT, 1737A New Treatise on Fluxions.
50.
SimpsonT, 1750The Doctrine and Application of Fluxionsvolumes 1 and 2 (J Nourse, London)
51.
SlaterP B, 1984, “Tree representation of internal migration flows and related topics”, Community and Organizational Research Institute, University of California, Sant Barbara, CA
52.
TanneryPHenryC (Eds), 1891–1922Ouvres de Fermat5 volumes
53.
TorricelliE, 1644Opera Geometrica.
54.
WeberA, 1909Über den Standort der Industrien: Erster Teil, Reine Theorie de Standorts (JCB Mohr, Tübingen)
55.
WeberA, 1922, “Vorwart zur 2, Auflage”Über den Standort der Industrien: Erster Teil, Reine Theorie de Standorts2nd edition (JCB Mohr, Tübingen) page v
56.
WeiszfeldE, 1937, “Sur le point pour lequel la somme des distances de n points donné est minimum”Tôkohu Journal of Mathematics37355–386
57.
ZachariasM, 1931, “Elementargeomertie und elementare nicht Euklidische Geometrie in synthetischer Behandlung”Encyklopädie der Mathematischen Wissenschaften3(AB 9) 859–1172
