Abstract
The paper considers optimization algorithms for location planning, which specifies positions of facilities providing demanded services. Examples of facilities include hospitals, restaurants, ambulances, retail and grocery stores, schools, and fire stations. We reduced the initial problem to approximation of a discrete distribution with a large number of atoms by some other discrete distribution with a smaller number of atoms. The approximation is done by minimizing the Kantorovich–Rubinstein distance between distributions. Positions and probabilities of atoms of the approximating distribution are optimized. The algorithm solves a sequence of optimization problems reducing the distance between distributions. We conducted a case study using Portfolio Safeguard (PSG) optimization package in MATLAB environment.
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
References
American Optimal Decisions (AORDA), Portfolio Safeguard (PSG), http://www.aorda.com
Ahmadian S., Norouzi-Fard A., Svensson O., Ward, J. (2017) Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), https://doi.org/10.1109/FOCS.2017.15.
Chen K. (2006) On k-Median Clustering in High Dimensions, Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22–26, 1177–1185.
Chung J.K., Kannappan P.L., Ng C.T., Sahoo P.K. (1989) Measures of Distance between Probability Distributions, Journal of mathematical analysis and applications, Vol. 138, pp. 280–292.
David A., Vassilvitskii S. (2007) K-means++: The Advantages of Careful Seeding, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 07, 1027–1035.
Deng Y., Du W. (2009) The Kantorovich Metric in Computer Science: A Brief Survey, Electronic Notes in Theoretical Computer Science, Elsevier, Vol. 253, Iss. 3, 73–82. https://doi.org/10.1016/j.entcs.2009.10.006.
Fayed A., Atiya A. (2013) A Mixed Breadth-depth First Strategy for the Branch and Bound Tree of Euclidean k-Center Problems, Computational Optimization and Applications, Springer, Vol. 30, Iss. 2, https://doi.org/10.1007/s10589-012-9503-x.
Fernandes I.F., Aloise D., Aloise D.J., Hansen P., Liberti L. (2014) On the Weber facility location problem with limited distances and side constraints, Optimization Letters, Springer, Vol. 8, Iss. 2, 407–424. https://doi.org/10.1007/s11590-012-0538-9
Geunes J., Pardalos P.M. (Editors) (2005) Supply Chain Optimization. Applied optimization, Springer, Vol. 98, 414.
Kantorovich L.V. (1942) On the Translocation of Masses, Dokl. Akad. Nauk SSSR, Vol. 37, N-s. 7–8, 227–229.
Kantorovich L.V. (1948) On a Problem of Monge, Uspekhi Mat. Nauk, Vol. 3, No. 2, 225–226.
Kantorovich L.V., Rubinstein G.Sh. (1958) On a Space of Totally Additive Functions, Vestn. Lening. Univ., Vol. 13, No. 7, 52–59.
Kantorovich L. (1958) On the Translocation of Masses, Management Science, Vol. 5, No. 1, 1–4.
Kumar A. (2016) Capacitated k-Center Problem with Vertex Weights, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016), No. 8, 1–14.
Lattanzi S., Vassilvitskii S. (2017) Consistent k-Clustering, Proceedings of the 34th International Conference on Machine Learning, Sydney, Australia, PMLR 70.
Li S., Svensson O. (2016) Approximating k-Median via Pseudo-approximation, SIAM J. Comput., 45(2), 530–547.
Meloa M.T., Nickelab S., Saldanha da Gamac F. (2006) Dynamic Multi-commodity Capacitated Facility Location: a Mathematical Modeling Framework for Strategic Supply Chain Planning, Computers and Operations Research, Vol. 33, Iss. 1, 181–208.
Pavlikov K., Uryasev S. (2018) CVaR Distance Between Univariate Probability Distributions and Approximation Problems, Annals of Operations Research, Vol. 262, Iss. 1, 67–88. https://doi.org/10.1007/s10479-017-2732-8
Pflug G.Ch., Pichler A. (2011) Approximations for Probability Distributions and Stochastic Optimization Problems, Stochastic Optimization Methods in Finance and Energy, Springer, Vol. 163, 343–387.
Rachev S.T., Stoyanov S.V., Fabozzi F.G. (2011) A Probability Metrics Approach to Financial Risk Measures, New York: John Wiley & Sons.
Vershik A.M. (2006) Kantorovich Metric: Initial History and Little-Known Applications, Journal of Mathematical Sciences, Springer, Vol. 133, Iss. 4, 1410–1417.
Zarinbal M. (2009) Distance Functions in Location Problems, Facility Location. Contributions to Management Science, Springer, 5–17. https://doi.org/10.1007/978-3-7908-2151-2_1.
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
Kuzmenko, V., Uryasev, S. (2019). Kantorovich–Rubinstein Distance Minimization: Application to Location Problems. In: Velásquez-Bermúdez, J., Khakifirooz, M., Fathi, M. (eds) Large Scale Optimization in Supply Chains and Smart Manufacturing. Springer Optimization and Its Applications, vol 149. Springer, Cham. https://doi.org/10.1007/978-3-030-22788-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-22788-3_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-22787-6
Online ISBN: 978-3-030-22788-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)