Exact and Approximate Solutions to the Multisource Weber Problem
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 . 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).
KeywordsActive Node Node Storage Initial Source Weber Problem Sink Location
Unable to display preview. Download preview PDF.
- Deetz, C. H., and O. S. Adams, Elements of map projection, US Department of Commerce, Special Publication no. 68, Washington, DC (1945).Google Scholar
- 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
- 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
- United States Census of Population, 1960, US Summary, Number of Inhabitants, Washington, DC (1960).Google Scholar
- 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