Abstract
The problem considered is the choice of locations form sources so as to minimize the sum of weighted distances betweenn fixed sinks and the source closest to each sink. The weights represent the amounts to be shipped between the sinks and their respective sources; the allowable source locations are free of restriction. An algorithm for the approximate solution of the problem, and computational experience with it, are discussed first. A branch-and-bound algorithm for exact solution of the problem is then developed, and computational experience with it is described.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Agin, “Optimum seeking with branch-and-bound,”Management Science 13 (1966) B176-B185.
R. Bellman, “An application of dynamic programming to location-allocation problems,”SIAM Review 7 (1965) 126–128.
L. Cooper, “Location-allocation problems,”Operations Research 11 (1963) 331–343.
L. Cooper, “Heuristic methods for location-allocation problems,”SIAM Review 6 (1964) 37–52.
L. Cooper, “Solutions of generalized locational equilibrium models,”Journal of Regional Science 7 (1967) 1–18.
C.H. Deetz and O.S. Adams,Elements of map projection, U.S. Department of Commerce, Special Publication # 68, Fifth Edition, Washington, D.C., 1945.
S. Eilon, and C.D.T. Watson-Gandy, “Models for determining depot location,” Imperial College of Science and Technology Report No. 69/4.
R.E. Kuenne and R.M. Soland,The multisource Weber problem: Exact solutions by branch and bound, IDA Economic Series, Institute for Defense Analyses, Arlington, Va., 1971.
H.W. Kuhn 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) 21–33.
E.L. Lawler and D.E. Wood, “Branch and bound methods: a survey,”Operations Research 14 (1966) 699–719.
W. Miehle, “Link-length minimization in networks,”Operations Research 6 (1958) 232–243.
L.G. Mitten, “Branch and bound methods: general formulation and properties,”Operations Research 18 (1970) 24–34.
J. Ponstein, “Seven kinds of convexity,”SIAM Review 9 (1967) 115–119.
United States Census of Population, 1960, U.S. Summary, Number of Inhabitants, Washington, D.C.
A. Weber,Ü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
Additional information
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 Program Analysis Division, Institute for Defense Analyses, Arlington, Virginia.
Rights and permissions
About this article
Cite this article
Kuenne, R.E., Soland, R.M. Exact and approximate solutions to the multisource weber problem. Mathematical Programming 3, 193–209 (1972). https://doi.org/10.1007/BF01584989
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584989