Abstract
Weber’s problem involves the optimum location of a single facility on a plane in such a way that the weighted sum of the Euclidean distances of the facility from n given points be at the global minimum. Each point can either have an attractive or repulsive effect on the location of the facility depending on whether the corresponding weight is positive or negative respectively. Because attractive contributions correspond to convex functions and repulsive contributions to concave ones, the total expression for the weighted sum of Euclidean distances is nonconvex. In this paper, two global optimization algorithms are proposed, one based on a concave and one on a concave + convex lower bounding operation. Both of these algorithms utilize efficient rectangular subdivision processes. The proposed approaches attain ∈-convergence to the global minimum in a finite number of iterations. Computational results are presented for problems involving as many as n = 10,000 points.
Financial support from the National Science Foundation under Grant CBT-8857013 as well as Amoco Chemicals Co., Mobil Co., and Tennessee Eastman Co. is gratefully acknowledged.
Author to whom all correspondence should be addressed.
This is a preview of subscription content, log in via an institution to check access.
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
Weiszfeld, E. (1937), “ Sur le point pour lequel la somme des distances de n points donnes est minimum,” Tohoku Mathematical Journal 43, 355–386.
Kuhn, H. W. (1967), On a Pair of Dual Nonlinear Programs, Nonlinear Programming, North Holland, Amsterdam, 38–54.
Kuhn, H. W. (1973), “A Note on Fermat’s Problem,” Mathematical Programming 4, 94–107.
Kuhn, H. W. (1974), “Steiner’s Problem Revisited,” Studies in Optimization, Mathematical Association of America, Washington, DC, 52–70.
Ostresh, L. M. (1978), “On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem,” Operations Research 26, 597–609.
Balas, E. and Yu, C. S. (1982), “A Note on the Weiszfeld-Kuhn Algorithm for the General Fermat Problem,” Mgmt. Sci. Res. Rep. 484, 1–6
Wang, C. Y. (1975), “On the Convergence and Rate of Convergence of an Iterative Algorithm for the Plant Location Problem,” Qufu Shiyun Xuebao 2, 14–25.
Calamai, P. H. and Conn, A. R. (1980), “A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances,” Siam Journal on Scientific and Statistical Computing 1, 512–526.
Calamai, P. H. and Conn, A. R. (1982), “A Second-Order Method for Solving the Continuous Multifacility Location Problem,” Numerical Analysis: Proceedings of the Ninth Biennial Conference, Dundee, Scotland, Spring-Verlag, Berlin, 1–25.
Calamai, P. H. and Conn, A. R. (1987), “A Projected Newton Method for lp Norm Location Problems,” Mathematical Programming 38, 75–109.
Overton, M. L. (1983), “A Quadratically Convergent Method for Minimizing a Sum of Euclidean Norms,” Mathematical Programming 27, 34–63.
Xue, G.-L. (1987), “A Fast Convergent Algorithm for min Σ mi=1 ‖x —a i‖ on a Closed Convex Set,” Journal of Qufu Normal University 13, No. 5, 15–20.
Xue, G.-L. (1989), “A Globally and Quadratically Convergent Algorithm for min Σ mi=1 ‖x — a i‖ Type Plant Location Problem,” Acta Mathematicae Applicatae Sinica 12, 65–72.
Rosen, J. B. and Xue, G.-L. (1991), “Computational Comparison of Two Algorithms for the Euclidean Single Facility Location Problem,” ORSA Journal on Computing 3, 207–212.
Tellier, L.-N. (1972), “The Weber Problem: Solution and Interpretation,” Geographical Analysis 4, 215–233.
Tellier, L.-N. and Ceccaldi, X. (1983), “Phenomenes de polarization et de repulsion dans le context du probleme de Weber,” Canadian Regional Science Association, Vancouver.
Tellier, L.-N. (1985), Économie patiale: rationalité économique de V espace habité, Chicoutimi, Québec: Gaétan Morin.
Tellier, L.-N. (1989), “The Weber Problem: frequency of different solution types and extension to repulsive forces and dynamic processes,” Journal of Regional Science 29, 387–405.
Drezner, Z. and Wesolowsky, G. O. (1991), “The Weber Problem on the Plane with some Negative Weights,” Infor 29, 87–99.
Chen, P.-C., Hansen, P., Jaumard, B. and Tuy, H. (December 1992), “Weber’s Problem with Attraction and Repulsion,” Journal of Regional Science.
Witzgall, C. (1984), Optimal Location of a Single Facility: Mathematical Models and Concepts, National Bureau of Standards, Report 8388.
Plastria, F. (1992), “The Effects of Majority in Fermat-Weber Problems with Attraction and Repulsion,” Yugor, Yugoslav Journal of Operations Research 1.
Horst, R. and Tuy, H. (1990), Global Optimization, Deterministic Approaches, Springer-Verlag, Berlin.
Maranas, C. D. and Floudas, C. A. (1992), “A Global Optimization Approach for Lennard-Jones Microclusters,” Journal of Chemical Physics 97, No. 10, 7667–7678.
Maranas, C. D. and Floudas, C. A. (1993), “Global Optimization for Molecular Conformation Problems,” Annals of Operations Research 42, 85–117.
Maranas, C. D. and Floudas, C. A. (1993), “Global Minimum Potential Energy Conformations of Small Molecules,” accepted in, Journal of Global Optimization.
Liu, W. B. and Floudas, C. A. (1993), “A Remark on the GOP Algorithm for Global Optimization,” Journal of Global Optimization 3, No. 4, in press.
Liu, W. B. and Floudas, C. A. (1993), “Convergence of the (GOP) Algorithm for a Large Class of Smooth Optimization Problems,” submitted.
Brooke, A., Kendrick, D. and Meeraus, A. (1988), GAMS A User’s Guide, The International Bank for Reconstruction and Development/The World Bank.
Murtagh, B.A. and Saunders, M.A. (1987), MINOS 5.3 User’s Guide, Systems Optimization Laboratory, Department of Operations Research, Stanford University.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Kluwer Academic Publishers
About this chapter
Cite this chapter
Maranas, C.D., Floudas, C.A. (1994). A Global Optimization Method For Weber’s Problem With Attraction And Repulsion. In: Hager, W.W., Hearn, D.W., Pardalos, P.M. (eds) Large Scale Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3632-7_14
Download citation
DOI: https://doi.org/10.1007/978-1-4613-3632-7_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-3634-1
Online ISBN: 978-1-4613-3632-7
eBook Packages: Springer Book Archive