Abstract
In this paper, we propose a novel algorithm for solving the classical P-median problem. The essential aim is to identify the optimal extended Lagrangian multipliers corresponding to the optimal solution of the underlying problem. For this, we first explore the structure of the data matrix in P-median problem to recast it as another equivalent global optimization problem over the space of the extended Lagrangian multipliers. Then we present a stochastic search algorithm to find the extended Lagrangian multipliers corresponding to the optimal solution of the original P-median problem. Numerical experiments illustrate that the proposed algorithm can effectively find a global optimal or very good suboptimal solution to the underlying P-median problem, especially for the computationally challenging subclass of P-median problems with a large gap between the optimal solution of the original problem and that of its Lagrangian relaxation.
Similar content being viewed by others
References
Ackermann, M.R., Blömer, J., Sohler, C.: Clustering for metric and nonmetric distance measures. ACM Trans. Algorithms (TALG) 6(4), 59 (2010)
Alp, O., Erkut, E., Drezner, Z.: An efficient genetic algorithm for the p-median problem. Ann. Oper. Res. 122(1–4), 21–42 (2003)
Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM J. Comput 33(3), 544–562 (2004)
Barahona, F., Anbil, R.: The volume algorithm: producing primal solutions with a subgradient method. Math. Program. 87(3), 385–399 (2000)
Beasley, J.E.: A note on solving large p-median problems. Eur. J. Oper. Res. 21(2), 270–273 (1985)
Beasley, J.E.: Lagrangean heuristics for location problems. Eur. J. Oper. Res. 65(3), 383–399 (1993)
Beltran, C., Tadonki, C., Vial, J.P.: Solving the p-median problem with a semi-lagrangian relaxation. Comput. Optim. Appl. 35(2), 239–260 (2006)
Bianchi, L., Dorigo, M., Gambardella, L.M., Gutjahr, W.J.: A survey on metaheuristics for stochastic combinatorial optimization. Nat. Comput. Int. J. 8(2), 239–287 (2009)
Chiou, Y.C., Lan, L.W.: Genetic clustering algorithms. Eur. J. Oper. Res. 135(2), 413–427 (2001)
Chiyoshi, F., Galvao, R.D.: A statistical analysis of simulated annealing applied to the p-median problem. Ann. Oper. Res. 96(1–4), 61–74 (2000)
Cornuejols, G., Fisher, M.L., Nemhauser, G.L.: Exceptional paper-location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Manag. Sci. 23(8), 789–810 (1977)
Cornuéjols, G., Nemhauser, G.L., Wolsey, L.A.: The uncapacitated facility location problem. Wiley, New York (1989)
Correa, E.S., Steiner, M.T.A., Freitas, A.A., Carnieri, C.: A genetic algorithm for solving a capacitated p-median problem. Numer. Algorithms 35(2–4), 373–388 (2004)
Crainic, T.G., Gendreau, M., Hansen, P., Mladenović, N.: Cooperative parallel variable neighborhood search for the p-median. J. Heuristics 10(3), 293–314 (2004)
Fathali, J., Kakhki, H.T.: Solving the \(p\) median problem with pos/neg weights by variable neighborhood search and some results for special cases. Eur. J. Oper. Res. 170(2), 440–462 (2006)
Fisher, M.L.: Lagrangian relaxation method for solving integer programming problems. Manag. Sci. 27, 1–18 (1981)
Galvão, R.D.: A dual-bounded algorithm for the p-median problem. Oper. Res. 28(5), 1112–1121 (1980)
Galvão, R.D., ReVelle, C.: A lagrangean heuristic for the maximal covering location problem. Eur. J. Oper. Res. 88(1), 114–123 (1996)
García-López, F., Melián-Batista, B., Moreno-Pérez, J.A., Moreno-Vega, J.M.: The parallel variable neighborhood search for the p-median problem. J. Heuristics 8(3), 375–388 (2002)
Hansen, P., Mladenović, N.: Variable neighborhood search for the p-median. Locat. Sci. 5(4), 207–226 (1997)
Hu, J., Fu, M.C., Marcus, S.I.: A model reference adaptive search method for global optimization. Oper. Res. 55(3), 549–568 (2007)
Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. J. ACM 48(2), 274–296 (2001)
Kochetov, Y., Alekseeva, E., Levanova, T., Loresh, M.: Large neighborhood local search for the p-median problem. Yugosl. J. Oper. Res. ISSN: 0354-0243 EISSN: 2334-6043 15(1) (2005)
Kochetov, Y., Ivanenko, D.: Computationally difficult instances for the uncapacitated facility location problem. In: Ibaraki T, Nonobe K, Yagiura M (eds.) Metaheuristics: Progress as Real Problem Solvers, pp. 351–367. Springer (2005)
Levanova, T., Loresh, M.: Algorithms of ant system and simulated annealing for the p-median problem. Autom. Remote Control 65(3), 431–438 (2004)
Lim, A., Xu, Z.: A fixed-length subset genetic algorithm for the p-median problem. In: Genetic and Evolutionary Computation Conference, pp. 1596–1597. Springer (2003)
Mladenović, N., Brimberg, J., Hansen, P., Moreno-Pérez, J.A.: The \(p\) median problem: a survey of metaheuristic approaches. Eur. J. Oper. Res. 179(3), 927–939 (2007)
Mulvey, J.M., Crowder, H.P.: Cluster analysis: an application of lagrangian relaxation. Manag. Sci. 25(4), 329–340 (1979)
Murray, A.T., Church, R.L.: Applying simulated annealing to location-planning models. J. Heuristics 2(1), 31–53 (1996)
Posta, M., Ferland, J.A., Michelon, P.: An exact cooperative method for the uncapacitated facility location problem. Math. Program. Comput. 6(3), 199–231 (2014)
Resende, M.G., Werneck, R.F.: A hybrid heuristic for the p-median problem. J. Heuristics 10(1), 59–88 (2004)
Rolland, E., Schilling, D.A., Current, J.R.: An efficient tabu search procedure for the p-median problem. Eur. J, Oper. Res. 96(2), 329–342 (1997)
Rosing, K.E., ReVelle, C., Rosing-Vogelaar, H.: The p-median and its linear programming relaxation: an approach to large problems. J. Oper. Res. Soc. 30, 815–823 (1979)
Rubinstein, R.Y., Kroese, D.P.: The cross-entropy method: a unified approach to combinatorial optimization, Monte-Carlo simulation and machine learning. Springer Science & Business Media, Berlin (2013)
Salhi, S.: Defining tabu list size and aspiration criterion within tabu search methods. Comput. Oper. Res. 29(1), 67–86 (2002)
Zhou, E., Hu, J.: Gradient-based adaptive stochastic search for non-differentiable optimization. IEEE Trans. Autom. Control 59(7), 1818–1832 (2014)
Zlochin, M., Birattari, M., Meuleau, N., Dorigo, M.: Model-based search for combinatorial optimization: a critical survey. Ann. Oper. Res. 131(1–4), 373–395 (2004)
Acknowledgments
The research of the first two authors are supported by the National Science Foundation Graduate Research Fellowship under Grant 0946809, the National Science Foundation under Grant CMMI-1413790, Air Force office of Scientific Research under Grant FA-9550-14-1-0059, and AFRL Mathematical Modeling and Optimization Institute. The research of the last author is supported by NSF Award CMMI-1131690. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation, the Air Force office of Scientific Research and the AFRL Mathematical Modeling and Optimization Institute.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hale, J.Q., Zhou, E. & Peng, J. A Lagrangian search method for the P-median problem. J Glob Optim 69, 137–156 (2017). https://doi.org/10.1007/s10898-016-0481-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-016-0481-x