Abstract
In this paper we address the problem of locating a new facility on a d-dimensional space when the distance measure (\(\ell _p\)- or polyhedral-norms) is different at each one of the sides of a given hyperplane \(\mathcal {H}\). We relate this problem with the physical phenomenon of refraction, and extend it to any finite dimensional space and different distances at each one of the sides of any hyperplane. An application to this problem is the location of a facility within or outside an urban area where different distance measures must be used. We provide a new second order cone programming formulation, based on the \(\ell _p\)-norm representation given in Blanco et al. (Comput Optim Appl 58(3):563–595, 2014) that allows to solve the problem in any finite dimensional space with second order cone or semidefinite programming tools. We also extend the problem to the case where the hyperplane is considered as a rapid transit media (a different third norm is also considered over \(\mathcal {H}\)) that allows the demand to travel, whenever it is convenient, through \(\mathcal {H}\) to reach the new facility. Extensive computational experiments run in Gurobi are reported in order to show the effectiveness of the approach. Some extensions of these models are also presented.












Similar content being viewed by others
References
Albareda, M., Fernández, E., Hinojosa, Y., Puerto, J.: The multi-period incremental service facility location problem. Comput. Oper. Res. 36, 1356–1375 (2009)
Alizadeh, F., Goldfarb, D.: Second order cone programming. Math. Program. 95, 3–51 (2003)
Aybat, N.S., Iyengar, G.: A unified approach for minimizing composite norms. Math. Program. A 144, 181–226 (2014)
Blanco, V., Puerto, J.: El-Haj Ben-Ali, S.: Revisiting several problems and algorithms in continuous location with \(l_\tau \) norms. Comput. Optim. Appl. 58(3), 563–595 (2014)
Brimberg, J.: The Fermat–Weber location problem revisited. Math. Program. 71(1), 71–76 (1995)
Brimberg, J., Kakhki, H.T., Wesolowsky, G.O.: Location among regions with varying norms. Ann. Oper. Res. 122(1–4), 87–102 (2003)
Brimberg, J., Kakhki, H.T., Wesolowsky, G.O.: Locating a single facility in the plane in the presence of a bounded region and different norms. J. Oper. Res.Soc. Jpn. 48(2), 135–147 (2005)
Cánovas, L., Marín, A., Cañavate, R.: On the convergence of the Weiszfeld algorithm. Math. Program. 93, 327–330 (2002)
Carrizosa, E., Rodríguez-Chía, A.: Weber problems with alternative transportation systems. Eur. J. Oper. Res. 97(1), 87–93 (1997)
Drezner, Z., Hamacher, H.W. (eds.): Facility Location: Applications and Theory. Springer, New York (2002)
Edlesbrunner, H.: Algorithms in Combinatorial Geometry. Springer, Berlin (1987)
Eilon, S., Watson-Gandy, C., Christofides, N.: Distribution management: mathematical modeling and practical analysis. Oper. Res. Q. 20, 309 (1971)
Eckhardt, U.: Weber’s problem and Weiszfeld’s algorithm in general spaces. Math. Program. 18, 186–196 (1980)
Fathali, J., Zaferanieh, M.: Location problems in regions with \(\ell _p\) and block norms. Iran. J. Oper. Res. 2(2), 72–87 (2011)
Franco, L., Velasco, F., Gonzalez-Abril, L.: Gate points in continuous location between regions with different \(\ell _p\) norms. Eur. J. Oper. Res. 218(3), 648–655 (2012)
Lasserre, J.B.: Moments, Positive Polynomials and Their Applications. Imperial College Press, London (2009)
Mangasarian, O.L.: Arbitrary-norm separating plane. Oper. Res. Lett. 24(1–2), 15–23 (1999)
Parlar, M.: Single facility location problem with region-dependent distance metrics. Int. J. Syst. Sci. 25(3), 513–525 (1994)
Marín, A., Nickel, S., Puerto, J., Velten, S.: A flexible model and efficient solution strategies for discrete location problems. Discrete Appl. Math. 157, 1128–1145 (2009)
Mesa, J.A., Puerto, J., Tamir, A.: Improved algorithms for several network location problems with equality measures. Discrete Appl. Math. 130, 437–448 (2003)
Nickel, S., Puerto, J.: Facility Location—A Unified Approach. Springer, Berlin (2005)
Nickel, S., Puerto, J., Rodrguez-Cha, A.M.: An approach to location models involving sets as existing facilities. Math. Oper. Res. 28(4), 693–715 (2003)
Puerto, J., Rodríguez-Chía, A.M.: On the structure of the solution set for the single facility location problem with average distances. Math. Program. 128, 373–401 (2011)
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)
Rodríguez-Chía, A., Valero-Franco, C.: On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _p\) distances for \(p > 2\). Math. Program. 137, 477–502 (2013)
Ward, J.E., Wendell, R.E.: Using block norms for location modeling. Oper. Res. 33(5), 1074–1090 (1985)
Zaferanieh, M., Taghizadeh Kakhki, H., Brimberg, J., Wesolowsky, G.O.: A BSSS algorithm for the single facility location problem in two regions with different norms. Eur. J. Oper. Res. 190(1), 79–89 (2008)
Acknowledgments
The authors were partially supported by the project FQM-5849 (Junta de Andalucía \(\backslash \)FEDER). The first and second authors were partially supported by projects MTM2010-19576-C02-01 and MTM2013-46962-C2-1-P (MICINN, Spain). The authors want also to acknowledge the anonymous referees for their constructive comments on previous versions of this paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Blanco, V., Puerto, J. & Ponce, D. Continuous location under the effect of ‘refraction’. Math. Program. 161, 33–72 (2017). https://doi.org/10.1007/s10107-016-1002-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-016-1002-x