Skip to main content

Advertisement

SpringerLink
Log in

Complement to a comparative analysis of heuristics for the p-median problem

  • Published:
Statistics and Computing Aims and scope Submit manuscript

Abstract

A recent comparison of evolutionary, neural network, and scatter search heuristics for solving the p-median problem is completed by (i) gathering or obtaining exact optimal values in order to evaluate errors precisely, and (ii) including results obtained with several variants of a variable neighborhood search (VNS) heuristic. For a first, well-known, series of instances, the average errors of the evolutionary and neural network heuristics are over 10% and more than 1000 times larger than that of VNS. For a second series, this error is about 3% while the errors of the parallel VNS and of a hybrid heuristic are about 0.01% and that of parallel scatter search even smaller.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Alba, E., Domínguez, E.: Comparative analysis of modern optimization tools for the p-median problem. Stat. Comput. 16, 251–260 (2006)

    Article  MathSciNet  Google Scholar 

  • Beasley, J.E.: A note on solving large p-median problems. Eur. J. Oper. Res. 21, 270–273 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  • Brandeau, M.L., Chiu, S.S.: An overview of representative problems in location research. Manag. Sci. 35, 645–674 (1989)

    MATH  MathSciNet  Google Scholar 

  • Crainic, T., Toulouse, M.: Parallel strategies for metaheuristics. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 475–513. Kluwer Academic, Dordrecht (2003)

    Chapter  Google Scholar 

  • Crainic, T., Gendreau, M., Hansen, P., Mladenović, N.: Cooperative parallel variable neighborhood search for the p-median. J. Heuristics 10, 289–310 (2004)

    Google Scholar 

  • du Merle, O., Villeneuve, D., Desrosiers, J., Hansen, P.: Stabilized column generation. Discret. Math. 194, 229–237 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  • 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, 375–388 (2002)

    Article  MATH  Google Scholar 

  • García-López, F., Melián Batista, B., Moreno Pérez, J.A., Moreno Vega, J.M.: Parallelization of the scatter search for the p-median problem. Parallel Comput. 29, 575–589 (2003)

    Article  Google Scholar 

  • Hakimi, S.L.: Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper. Res. 13, 462–472 (1965)

    Article  MATH  MathSciNet  Google Scholar 

  • Hansen, P., Mladenović, N.: Variable neighborhood search for the p-Median. Locat. Sci. 5, 207–226 (1997)

    Article  MATH  Google Scholar 

  • Hansen, P., Mladenović, N.: Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. 130, 449–467 (2001)

    Article  MATH  Google Scholar 

  • Hansen, P., Mladenović, N., Perez-Brito, D.: Variable neighborhood decomposition search. J. Heuristics 7, 335–350 (2001)

    Article  MATH  Google Scholar 

  • Hansen, P., Brimberg, J., Urošević, D., Mladenović, N.: Primal-dual variable neighborhood search for the simple plant location problem. INFORMS J. Comput. (2007, in press). doi: 10.1287/ijoc.1060.0196

  • Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems, Part 2. The p-medians. SIAM J. Appl. Math. 37, 539–560 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  • Labbé, M., Louveaux, F.V.: Location problems. In: Dell’Amico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 261–281. Wiley, New York (1997)

    Google Scholar 

  • Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  • Mladenović, N., Brimberg, J., Hansen, P., Moreno-Perez, J.: The p-median problem: A survey of metaheuristic approaches. Eur. J. Oper. Res. 179, 927–939 (2007)

    Article  MATH  Google Scholar 

  • Moreno-Perez, J.A., Hansen, P., Mladenović, N.: Parallel variable neighborhood search. In: Alba, E. (ed.) Parallel Metaheuristics: A New Class of Algorithms, pp. 247–266. Wiley, New York (2005)

    Chapter  Google Scholar 

  • Moscato, P., Cotta, C.: A gentle introduction to Memetic Algorithms. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 105–144. Kluwer Academic, Boston/Dordrecht/London (2003)

    Chapter  Google Scholar 

  • Reinelt, G.: tsplib—A traveling salesman problem library. ORSA J. Comput. 3, 376–384 (1991)

    MATH  Google Scholar 

  • Resende, M.G., Werneck, R.F.: A hybrid heuristic for the p-median problem. J. Heuristics 10, 59–88 (2004)

    Article  MATH  Google Scholar 

  • Whitaker, R.: A fast algorithm for the greedy-interchange for large-scale clustering and median location problems. INFOR 21, 95–108 (1983)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GERAD and HEC Montréal, Montréal, Québec, H3T 2A7, Canada

    Pierre Hansen

  2. GERAD and School of Mathematics, Brunel University, Kingston Lane, Uxbridge, London, UB8 3PH, UK

    Nenad Mladenović

Authors
  1. Pierre Hansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nenad Mladenović
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nenad Mladenović.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hansen, P., Mladenović, N. Complement to a comparative analysis of heuristics for the p-median problem. Stat Comput 18, 41–46 (2008). https://doi.org/10.1007/s11222-007-9036-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11222-007-9036-9

Keywords

Search

Navigation