Abstract
The basic aim of continuous location problems is to generate facility sites in a given continuous space, usually the Euclidean plane, in order to optimize some performance measure relative to a set of given points (customers). From a mathematical perspective, we may attribute the start of continuous location theory to Fermat who suggested the problem of locating a point in the plane that minimizes the sum of distances to three given points. The idea was generalized in an applied sense by Weber (1909) a few centuries later by extending the problem to any number ānā of given (or fixed) points representing markets and associating weights (or demands) to these points. The objective function, a weighted sum of distances from the facility to the given markets, now measured the cost of delivering goods to the markets as a function of the facility location. This function is known to be convex for any distance norm and hence amenable to solution by local descent methods. One such method developed for Euclidean distance, the well-known single-point iterative scheme by Weiszfeld (1936), has received much attention in the literature, including for example, seminal papers by Kuhn (1973) and Katz (1974), which studied the global and local convergence properties of this method. For further reading on the rich history of the continuous single-facility minisum (or 1-median) location problem, see Wesolowsky (1993) and Drezner et al. (2002).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bongartz, I., Calamai, P. H., & Conn, A. R. (1994). A projection method for lp norm location-allocation problems. Mathematical Programming, 66, 283ā312.
Brimberg, J., & Drezner, Z. (2013). A new heuristic for solving the p-median problem in the plane. Computers & Operations Research, 40, 427ā437.
Brimberg, J., Drezner, Z., MladenoviÄ, N., & Salhi, S. (2014). A new local search for continuous location problems. European Journal of Operational Research, 232, 256ā265.
Brimberg, J., Hansen, P., & MladenoviÄ, N. (2010). Attraction probabilities in variable neighborhood search. 4OR-Quarterly Journal of Operations Research, 8, 181ā194.
Brimberg, J., Hansen, P., MladenoviÄ, N., & Salhi, S. (2008). A survey of solution methods for the continuous location-allocation problem. International Journal of Operations Research, 5, 1ā12.
Brimberg, J., Hansen, P., MladenoviÄ, N., & Taillard, Ć. (2000). Improvements and comparison of heuristics for solving the multisource Weber problem. Operations Research, 48, 444ā460.
Brimberg, J., & Hodgson, M. J. (2011). Heuristics for location models. In H. A. Eiselt & V. Marianov (Eds.), Foundations of location analysis: Industrial series in operations research & management science (Vol. 155, pp. 335ā355). New York, NY: Springer.
Brimberg, J., & MladenoviÄ, N. (1996a). Solving the continuous location-allocation problem with Tabu search. Studies in Locational Analysis, 8, 23ā32.
Brimberg, J., & MladenoviÄ, N. (1996b). A variable neighborhood algorithm for solving the continuous location-allocation problem. Studies in Locational Analysis, 10, 1ā12.
Brimberg, J., & MladenoviÄ, N. (1999). Degeneracy in the multi-source Weber problem. Mathematical Programming, 85, 213ā220.
Chen, R. (1983). Solution of minisum and minimax location-allocation problems with Euclidean distances. Naval Research Logistics Quarterly, 30, 449ā459.
Cooper, L. (1963). Location-allocation problems. Operations Research, 11, 331ā343.
Cooper, L. (1964). Heuristic methods for location-allocation problems. SIAM Review, 6, 37ā53.
Drezner, Z. (1992). A note on the Weber location problem. Annals of Operations Research, 40, 153ā161.
Drezner, Z. (1995). A note on accelerating the Weiszfeld procedure. Location Science, 3, 275ā279.
Drezner, Z. (2002). A new heuristic for the quadratic assignment problem. Journal of Applied Mathematics and Decision Sciences, 6, 163ā173.
Drezner, Z. (2005). The extended concentric Tabu for the quadratic assignment problem. European Journal of Operational Research, 160, 416ā422.
Drezner, Z. (2015). The fortified Weiszfeld algorithm for solving the Weber problem. IMA Journal of Management Mathematics, 26, 1ā9.
Drezner, Z., Brimberg, J., MladenoviÄ, N., & Salhi, S. (2015a). Solving the planar p-median problem by variable neighborhood and concentric searches. Journal of Global Optimization, 63, 501ā514.
Drezner, Z., Brimberg, J., MladenoviÄ, N., & Salhi, S. (2015b). New heuristic algorithms for solving the planar p-median problem. Computers & Operations Research, 62, 296ā304.
Drezner, Z., Brimberg, J., MladenoviÄ, N., & Salhi, S. (2016). New local searches for solving the multi-source Weber problem. Annals of Operations Research, 246, 181ā203.
Drezner, Z., Klamroth, K., Schƶbel, A., & Wesolowsky, G. O. (2002). The Weber problem. In Z. Drezner & H. W. Hamacher (Eds.), Facility location: Applications and theory (pp. 1ā36). Berlin: Springer.
Drezner, Z., Mehrez, A., & Wesolowsky, G. O. (1991). The facility location problem with limited distances. Transportation Science, 25, 183ā187.
Drezner, Z., & Salhi, S. (2017). Incorporating neighbourhood reduction for the solution of the planar p-median problem. Annals of Operations Research, 258, 639ā654.
Drezner, Z., & Simchi-Levi, D. (1992). Asymptotic behavior of the Weber location problem on the plane. Annals of Operations Research, 40, 163ā172.
Eilon, S., Watson-Gandy, C. D. T., & Christofides, N. (1971). Distribution management: Mathematical modelling and practical analysis. London: Charles Griffin & Co., Ltd.
Hansen, P., & MladenoviÄ, N. (2006). First vs best improvement: An empirical study. Discrete Applied Mathematics, 154, 802ā817.
Hansen, P., MladenoviÄ, N., & Taillard, E. (1998). Heuristic solution of the multisource Weber problem as a p-median problem. Operations Research Letters, 22, 55ā62.
Katz, I. N. (1974). Local convergence in Fermatās problem. Mathematical Programming, 6, 89ā104.
Krau, S. (1997). Extensions du problĆØme de Weber. PhD ThĆØse, Ćcole Polytechnique de MontrĆ©al.
Kuhn, H. (1973). A note on Fermatās problem. Mathematical Programming, 4, 98ā107.
Love, R. F., & Juel, H. (1982). Properties and solution methods for large location-allocation problems. Journal of the Operational Research Society, 33, 443ā452.
Love, R. F., Morris, J. G., & Wesolowsky, G. O. (1988). Facilities location: Models and methods. New York: North-Holland.
Megiddo, M., & Supowit, K. J. (1984). On the complexity of some common geometric location problems. SIAM Journal of Computing, 13, 182ā196.
MladenoviÄ, N., & Brimberg, J. (1995). A descent-ascent technique for solving the multi-source Weber problem. Yugoslav Journal of Operations Research, 5, 211ā219.
Murtagh, B. A., & Niwattisyawong, S. R. (1982). An efficient method for the multi-depot location-allocation problem. Journal of the Operational Research Society, 33, 629ā634.
Ostresh, L. M., Jr. (1978). On the convergence of a class of iterative methods for solving the Weber location problem. Operations Research, 26, 597ā609.
Plastria, F. (1992). GBSSS, the generalized big square small square method for planar single facility location. European Journal of Operational Research, 62, 163ā174.
Reinelt, G. (1991). TSLIB a travelling salesman library. ORSA Journal of Computing, 3, 376ā384.
Salhi, S. (2017). Heuristic search: The emerging science of problem solving. Cham, Switzerland.
Teitz, M. B., & Bart, P. (1968). Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research, 16, 955ā961.
Weber, A. (1909). į¹ŗber den Standort der Industrien. TĆ¼bingen, Germany. (English translation: Friedrich CJ (translator) (1929), Theory of the location of industries. University of Chicago Press, Chicago)
Weiszfeld, E. (1936). Sur le point pour lequel la somme des distances de n points donnĆ©s est minimum. Tohoku Mathematical Journal, 43, 355ā386.
Wesolowsky, G. O. (1993). The Weber problem: History and perspectives. Location Science, 1, 5ā23.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Brimberg, J., Salhi, S. (2019). A General Framework for Local Search Applied to the Continuous p-Median Problem. In: Eiselt, H., Marianov, V. (eds) Contributions to Location Analysis. International Series in Operations Research & Management Science, vol 281. Springer, Cham. https://doi.org/10.1007/978-3-030-19111-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-19111-5_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-19110-8
Online ISBN: 978-3-030-19111-5
eBook Packages: Economics and FinanceEconomics and Finance (R0)