Abstract
This chapter analyzes the ordered median location problem in three different frameworks: continuous, discrete and networks; where some classical but also new results have been collected. For each solution space we study general properties that lead to resolution algorithms. In the continuous case, we present two solution approaches for the planar case with polyhedral norms (the most intuitive case) and a novel approach applicable for the general case based on a hierarchy of semidefinite programs that can approximate up to any degree of accuracy the solution of any ordered median problem in finite dimension spaces with polyhedral or ℓ p -norms. We also cover the problems on networks deriving finite dominating sets for some particular classes of λ parameters and showing the impossibility of finding a FDS with polynomial cardinality for general lambdas in the multifacility case. Finally, we present a covering based formulation for the capacitated discrete ordered median problem with binary assignment which is rather promising in terms of gap and CPU time for solving this family of problems.
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
Similar content being viewed by others
References
Ben-Israel A, Iyigun C (2010) A generalized Weiszfeld method for the multi-facility location problem. Oper Res Lett 38:207–214
Berman O, Kalcsics J, Krass D, Nickel S (2009) The ordered gradual covering location problem on a network. Discrete Appl Math 157:3689–3707
Blanco V, Ben Ali SEH, Puerto J (2013) Minimizing ordered weighted averaging of rational functions with applications to continuous location. Comput Oper Res 40:1448–1460
Blanco V, Ben Ali SEH, Puerto J (2014a) Revisiting several problems and algorithms in continuous location with l p norms. Comput Optim Appl 58:563–595
Blanco V, El-Haj Ben-Ali S, Puerto J (2014b) Continuous multifacility ordered median location problems. Ar**v:1401.0817v1, Ar**v.org
Blanquero R, Carrizosa E (2009) Continuous location problems and big triangle small triangle: constructing better bounds. J Global Optim 45:389–402
Boland N, Domínguez-Marín P, Nickel S, Puerto J (2006) Exact procedures for solving the discrete ordered median problem. Comput Oper Res 33:3270–3300
Brimberg J, Hansen P, Mladenovic N, Taillard ED (2000) Improvement and comparison of heuristics for solving the uncapacitated multisource weber problem. Oper Res 48:444–460
Domínguez-Marín P, Nickel S, Hansen P, Mladenović N (2005) Heuristic procedures for solving the discrete ordered median problem. Ann Oper Res 136:145–173
Drezner Z (2007) A general global optimization approach for solving location problems in the plane. J Global Optim 37:305–319
Drezner Z, Nickel S (2009a) Constructing a DC decomposition for ordered median problems. J Global Optim 45:187–201
Drezner Z, Nickel S (2009b) Solving the ordered one-median problem in the plane. Eur J Oper Res 195:46–61
Durier R, Michelot C (1985) Geometrical properties of the Fermat–Weber problem. Eur J Oper Res 20:332–343
Edelsbrunner H (1987) Algorithms in combinatorial geometry. Springer, New York
Espejo I, Marín A, Puerto J, Rodríguez-Chía AM (2009) A comparison of formulations and solution methods for the minimum-envy location problem. Comput Oper Res 36:1966–1981
Espejo I, Rodríguez-Chía AM, Valero C (2009) Convex ordered median problem with l p -norms. Comput Oper Res 36:2250–2262
Francis R, Lowe T, Tamir A (2000) Aggregation error bounds for a class of location models. Oper Res 48:294–307
Grzybowski J, Nickel S, Pallaschke D, Urbański R (2011) Ordered median functions and symmetries. Optimization 60:801–811
Hakimi S (1964) Optimal location of switching centers and the absolute centers and medians of a graph. Oper Res 12:450–459
Hakimi S, Labbé M, Schmeichel E (1992) The Voronoi partition of a network and its applications in location theory. Orsa J Comput 4:412–417
Hardy GH, Littlewood JE, Pólya G (1952) Inequalities, 2nd edn. Cambridge University Press, Cambridge
Hooker J, Garfinkel R, Chen C (1991) Finite dominating sets for network location problems. Oper Res 39:100–118
Jibetean D, de Klerk E (2006) Global optimization of rational functions: a semidefinite programming approach. Math Program 106:93–109
Kalcsics J, Nickel S, Puerto J, Tamir A (2002) Algorithmic results for ordered median problems. Oper Res Lett 30:149–158
Kalcsics J, Nickel S, Puerto J (2003) Multifacility ordered median problems on networks: a further analysis. Networks 41:1–12
Kalcsics J, Nickel S, Puerto J, Rodríguez-Chía AM (2010a) Distribution systems design with role dependent objectives. Eur J Oper Res 202:491–501
Kalcsics J, Nickel S, Puerto J, Rodríguez-Chía AM (2010b) The ordered capacitated facility location problem. TOP 18:203–222
Kim-Chuan T, Todd MJ, Tutuncu RH (2006) On the implementation and usage of sdpt3—a matlab software package for semidefinite-quadratic-linear programming, version 4.0. Optimization software. http://www.math.nus.edu.sg/~mattohkc/sdpt3/guide4-0-draft.pdf
Lasserre J (2009) Moments, positive polynomials and their applications. Imperial College Press, London
López-de-los-Mozos M, Mesa JA, Puerto J (2008) A generalized model of equality measures in network location problems. Comput Oper Res 35:651–660
Marín A, Nickel S, Puerto J, Velten S (2009) A flexible model and efficient solution strategies for discrete location problems. Discrete Appl Math 157:1128–1145
Marín A, Nickel S, Velten S (2010) An extended covering model for flexible discrete and equity location problems. Math Method Oper Res 71:125–163
McCormick S (2005) Submodular function minimization. In: Discrete optimization. Elsevier, Amsterdam, pp 321–391
Nickel S (2001) Discrete ordered Weber problems. In: Operations research proceedings 2000. Selected papers of the symposium, OR 2000, Dresden, 9–12 September 2000. Springer, Berlin, pp 71–76
Nickel S, Puerto J (1999) A unified approach to network location problems. Networks 34:283–290
Nickel S, Puerto J (2005) Location theory. A unified approach. Springer, Berlin
Nickel S, Puerto J, Rodríguez-Chía AM, Weissler A (2005) Multicriteria planar ordered median problems. J Optim Theory Appl 126:657–683
Okabe A, Boots B, Sugihara K (1992) Spatial tessellations: concepts and applications of Voronoĭ diagrams. Wiley series in probability and mathematical statistics: applied probability and statistics. Wiley, Chichester, with a foreword by D.G. Kendall
Papini P, Puerto J (2004) Averaging the k largest distances among n: k-centra in Banach spaces. J Math Anal Appl 291:477–487
Puerto J (2008) A new formulation of the capacitated discrete ordered median problems with {0, 1} assignment. In: Operations research proceedings 2007. Selected papers of the annual international conference of the German Operations Research Society (GOR), Saarbrücken, 5–7 September 2007. Springer, Berlin, pp 165–170
Puerto J, Fernández F (2000) Geometrical properties of the symmetric single facility location problem. J Nonlinear Convex Anal 1:321–342
Puerto J, Rodríguez-Chía AM (2005) On the exponential cardinality of FDS for the ordered p-median problem. Oper Res Lett 33:641–651
Puerto J, Tamir A (2005) Locating tree-shaped facilities using the ordered median objective. Math Program 102:313–338
Puerto J, Ramos AB, Rodríguez-Chía AM (2011) Single-allocation ordered median hub location problems. Comput Oper Res 38:559–570
Puerto J, Ramos AB, Rodríguez-Chía AM (2013) A specialized branch & bound & cut for single-allocation ordered median hub location problems. Discrete Appl Math 161:2624–2646
Puerto J, Pérez-Brito D, García-González C (2014) A modified variable neighborhood search for the discrete ordered median problem. Eur J Oper Res 234(1):61–76. doi:10.1016/j.ejor.2013.09.029
Rodríguez-Chía AM, Nickel S, Puerto J, Fernández FR (2000) A flexible approach to location problems. Math Method Oper Res 51:69–89
Rodríguez-Chía AM, Puerto J, Pérez-Brito D, Moreno JA (2005) The p-facility ordered median problem on networks. TOP 13:105–126
Rodríguez-Chía AM, Espejo I, Drezner Z (2010) On solving the planar k-centrum problem with Euclidean distances. Eur J Oper Res 207:1169–1186
Rosenbaum R (1950) Subadditive functions. Duke Math J 17:227–247
Schöbel A, Scholz D (2010) The big cube small cube solution method for multidimensional facility location problems. Comput Oper Res 37:115–122
Ward J, Wendell R (1985) Using block norms for location modeling. Oper Res 33:1074–1090
Yager R (1988) On ordered weighted averaging aggregation operators in multicriteria decision making. IEEE Trans Syst Man Cybern 18:183–190
Acknowledgements
The authors were partially supported by projects FQM-5849 (Junta de Andalucía∖FEDER), the Interuniversity Attraction Poles Programme initiated by the Belgian Science Policy Office, MTM2010-19576-C02-01/02 and MTM2013-46962-C02-01/02 (Ministry of Economy and Competitiveness∖FEDER, Spain).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Puerto, J., Rodríguez-Chía, A.M. (2015). Ordered Median Location Problems. In: Laporte, G., Nickel, S., Saldanha da Gama, F. (eds) Location Science. Springer, Cham. https://doi.org/10.1007/978-3-319-13111-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-13111-5_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13110-8
Online ISBN: 978-3-319-13111-5
eBook Packages: Business and EconomicsBusiness and Management (R0)