Abstract
The Multisource Weber problem, also known as the continuous location-allocation problem, or as the Fermat-Weber problem, is considered here. A particular case of the Multisource Weber problem is the minimum sum-of-distances clustering problem, also known as the continuous \(p\)-median problem. The mathematical modelling of this problem leads to a \(min-sum-min\) formulation which, in addition to its intrinsic bi-level nature, is strongly nondifferentiable. Moreover, it has a large number of local minimizers, so it is a typical global optimization problem. In order to overcome the intrinsic difficulties of the problem, the so called Hyperbolic Smoothing methodology, which follows a smoothing strategy using a special \( \, C^{\infty } \, \) differentiable class function, is adopted. The final solution is obtained by solving a sequence of low dimension \( \, C^{\infty } \, \) differentiable unconstrained optimization sub-problems which gradually approaches the original problem. For the purpose of illustrating both the reliability and the efficiency of the method, a set of computational experiments making use of traditional test problems described in the literature was performed. Apart from consistently presenting better results when compared to related approaches, the novel technique introduced here was able to deal with instances never tackled before in the context of the Multisource Weber problem.
Similar content being viewed by others
References
Bagirov, A.M., Al-Nuaimat, A., Sultanova, N.: Hyperbolic smoothing function method for minimax problems. Optimization (2012). doi:10.1080/0233/934.2012.675335
Bagirov, A.M., Ordin, B., Gurkan, O., Xavier, A.E.: An Incremental Clustering Algorithm Based on Smoothing Techniques, submitted to Computational Optimization and Applications (2012)
Bongartz, I., Calamai, P.H., Conn, A.R.: A projection method for \( l_p \) norm location-allocation problems. Math. Program. 66, 283–312 (1994)
Brimberg, J., Hansen, P., Mladenovic, N., Taillard, E.D.: Improvements and comparison of heuristics for solving the multisource weber problem. Oper. Res. 48, 129–135 (2000)
Koopmans, T.C., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25(1), 53–76 (1957)
Plastino, A., Fuchshuber, R., Martins, S.L., Freitas, A.A., Salhi, S.: A hybrid data mining metaheuristic for the \(p-\)median problem. Stat. Anal. Data Min. 4, 313–335 (2011)
Reinelt, G.: TSP-LIB: a traveling salesman library. ORSA J. Comput. 3(4), 376–384 (1991)
Rubinov, A.: Methods for global optimization of nonsmooth functions with applications. Appl. Comput. Math. 5(1), 3–15 (2006)
Santos, A.B.A.: Problemas de Programação Não- Diferenciável: Uma Metodologia de Suavização, M.Sc. thesis—COPPE—UFRJ, Rio de Janeiro (in Portuguese) (1997)
Wesolowsky, G.O.: The Weber Problem: History and Perspectives, Location Science, vol. 1, pp. 5–23 (1993)
Xavier, A.E.: Penalização Hiperbólica: Um Novo Método para Resolução de Problemas de Otimização, M.Sc. Thesis, COPPE—Federal University of Rio de Janeiro (in Portuguese) (1982)
Xavier, V.L.: Resolução do Problema de Agrupamento segundo o Critério de Minimização da Soma de Distâncias, M.Sc. thesis—COPPE—UFRJ, Rio de Janeiro (in Portuguese) (2012)
Xavier, A.E., Oliveira, A.A.F.: Optimal covering of plane domains by circles via hyperbolic smoothing. J. Glob. Optim. 31, 493–504 (2005)
Xavier, A.E.: The hyperbolic smoothing clustering method. Pattern Recognit. 43, 731–737 (2010)
Xavier, A.E., Xavier, V.L.: Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions. Pattern Recognit. 44, 70–77 (2011)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Xavier, V.L., França, F.M.G., Xavier, A.E. et al. A hyperbolic smoothing approach to the Multisource Weber problem. J Glob Optim 60, 49–58 (2014). https://doi.org/10.1007/s10898-014-0160-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-014-0160-8