Abstract
The concern of modern spatial economists with the optimal location of variable points (sources) in 2-space with respect to a set of fixed points (sinks), when the co-ordinates of the sources may vary continuously, dates from the publication of Alfred Weber’s work in industrial location theory [15]. Weber’s analysis was largely confined to the location of a single source, and, although he offered no method of solution, recent work has led to an efficient algorithm for exact solution of the problem (the single-source algorithm). The present paper treats the multisource Weber problem and presents (1) a branch-and-bound algorithm for the exact solution of the problem, which, to the best of our knowledge, is original (MULTIWEB), and (2) an approximate algorithm, to be used in support of MULTIWEB or in its place when appropriate, for which we claim no priority (CROSSCUT).
Co-authored by Richard M. Soland and published originally in Mathematical Programming, 3 (1972), pp. 193–209, and reproduced with permission of Elsevier Science Publishers.For a more detailed discussion of the analyses contained in the present paper, the computational results, and for detailed program listings, the reader is referred to [8]. Tapes for the two programs discussed in the present paper are available at cost of reproduction from Institute for Defense Analyses, Alexandria, Virginia, USA.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agin, N., ‘Optimum Seeking with Branch-and-bound’, Management Science, 13 (1966), pp. B176–B185.
Bellman, R., ‘An Application of Dynamic Programming to Location-Allocation Problems,’ SIAM Review, 7 (1965), pp. 126–8.
Cooper, L., ‘Location-Allocation Problems’, Operations Research, 11 (1963), pp. 331–43.
Cooper, L., ‘Heuristic Methods for Location-Allocation Problems, SIAM Review, 6 (1964), pp. 37–52.
Cooper, L., ‘Solutions of Generalized Locational Equilibrium Models’, Journal of Regional Science, 7 (1967), pp. 1–18.
Deetz, C. H., and O. S. Adams, Elements of map projection, US Department of Commerce, Special Publication no. 68, Washington, DC (1945).
Eilon, S., and C. D. T. Watson-Gandy, ‘Models for Determining Depot Location’, Imperial College of Science and Technology Report No. 69/4 (1969).
Kuenne, R. E., and R. M. Soland, The Multisource Weber Problem: Exact Solutions by Branch and Bound, IDA Economic Series, Institute for Defense Analyses, Arlington, Va. (1971).
Kuhn, H. W., and R. E. Kuenne, ‘An Efficient Algorithm for the Numerical Solution of the Generalized Weber Problem in Spatial Economics’, Journal of Regional Science 4, (1962), pp. 21–33. Reprinted as Chapter 9 of this volume.
Lawler, E. L., and D. E. Wood, ‘Branch and Bound Methods: a Survey’, Operations Research, 14 (1966), pp. 699–719.
Miehle, W., ‘Link-Length Minimization in Networks’, Operations Research, 6 (1958) pp. 232–43.
Mitten, L. G., ‘Branch and Bound Methods: General Formulation and Properties’, Operations Research, 18 (1970), pp. 24–34.
Ponstein, J., ‘Seven Kinds of Convexity’, SIAM Review, 9 (1967), pp. 115–19.
United States Census of Population, 1960, US Summary, Number of Inhabitants, Washington, DC (1960).
Weber, A., Über den Standort der Industrien Tübingen (1909). Translated as: ‘Alfred Weber’s Theory of the Location of Industries’ (University of Chicago, 1929).
Author information
Authors and Affiliations
Copyright information
© 1992 Robert E. Kuenne
About this chapter
Cite this chapter
Kuenne, R.E. (1992). Exact and Approximate Solutions to the Multisource Weber Problem. In: General Equilibrium Economics. Palgrave Macmillan, London. https://doi.org/10.1007/978-1-349-12752-8_11
Download citation
DOI: https://doi.org/10.1007/978-1-349-12752-8_11
Publisher Name: Palgrave Macmillan, London
Print ISBN: 978-1-349-12754-2
Online ISBN: 978-1-349-12752-8
eBook Packages: Palgrave Economics & Finance CollectionEconomics and Finance (R0)