Advertisement

Exact and Approximate Solutions to the Multisource Weber Problem

  • Robert E. Kuenne

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).

Keywords

Active Node Node Storage Initial Source Weber Problem Sink Location 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Agin, N., ‘Optimum Seeking with Branch-and-bound’, Management Science, 13 (1966), pp. B176–B185.CrossRefGoogle Scholar
  2. [2]
    Bellman, R., ‘An Application of Dynamic Programming to Location-Allocation Problems,’ SIAM Review, 7 (1965), pp. 126–8.CrossRefGoogle Scholar
  3. [3]
    Cooper, L., ‘Location-Allocation Problems’, Operations Research, 11 (1963), pp. 331–43.CrossRefGoogle Scholar
  4. [4]
    Cooper, L., ‘Heuristic Methods for Location-Allocation Problems, SIAM Review, 6 (1964), pp. 37–52.CrossRefGoogle Scholar
  5. [5]
    Cooper, L., ‘Solutions of Generalized Locational Equilibrium Models’, Journal of Regional Science, 7 (1967), pp. 1–18.CrossRefGoogle Scholar
  6. [6]
    Deetz, C. H., and O. S. Adams, Elements of map projection, US Department of Commerce, Special Publication no. 68, Washington, DC (1945).Google Scholar
  7. [7]
    Eilon, S., and C. D. T. Watson-Gandy, ‘Models for Determining Depot Location’, Imperial College of Science and Technology Report No. 69/4 (1969).Google Scholar
  8. [8]
    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).Google Scholar
  9. [9]
    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.CrossRefGoogle Scholar
  10. [10]
    Lawler, E. L., and D. E. Wood, ‘Branch and Bound Methods: a Survey’, Operations Research, 14 (1966), pp. 699–719.CrossRefGoogle Scholar
  11. [11]
    Miehle, W., ‘Link-Length Minimization in Networks’, Operations Research, 6 (1958) pp. 232–43.CrossRefGoogle Scholar
  12. [12]
    Mitten, L. G., ‘Branch and Bound Methods: General Formulation and Properties’, Operations Research, 18 (1970), pp. 24–34.CrossRefGoogle Scholar
  13. [13]
    Ponstein, J., ‘Seven Kinds of Convexity’, SIAM Review, 9 (1967), pp. 115–19.CrossRefGoogle Scholar
  14. [14]
    United States Census of Population, 1960, US Summary, Number of Inhabitants, Washington, DC (1960).Google Scholar
  15. [15]
    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).Google Scholar

Copyright information

© Robert E. Kuenne 1992

Authors and Affiliations

  • Robert E. Kuenne
    • 1
  1. 1.Princeton UniversityUSA

Personalised recommendations