Skip to main content
SpringerLink
Log in
Book cover

International Conference on Learning and Intelligent Optimization

LION 2017: Learning and Intelligent Optimization pp 79–92Cite as

A New Local Search for the p-Center Problem Based on the Critical Vertex Concept

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10556))

Abstract

For the p-center problem, we propose a new smart local search based on the critical vertex concept and embed it in a GRASP framework. Experimental results attest the robustness of the proposed search procedure and confirm that for benchmark instances it converges to optimal or near/optimal solutions faster than the best known state-of-the-art local search.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Coffin, M., Saltzman, M.: Statistical analysis of computational tests of algorithms and heuristics. INFORMS J. Comput. 12(1), 24–44 (2000)

    Article  MATH  Google Scholar 

  3. Daskin, M.: Network and Discrete Location: Models, Algorithms, and Applications. Wiley, New York (1995)

    Book  MATH  Google Scholar 

  4. Davidović, T., Ramljak, D., Šelmić, M., Teodorović, D.: Bee colony optimization for the \(p\)-center problem. Comput. Oper. Res. 38(10), 1367–1376 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dyer, M., Frieze, A.: A simple heuristic for the \(p\)-centre problem. Oper. Res. Lett. 3(6), 285–288 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  6. Feo, T., Resende, M.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67–71 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  7. Feo, T., Resende, M.: Greedy randomized adaptive search procedures. J. Global Optim. 6, 109–133 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  8. Festa, P., Resende, M.: GRASP: an annotated bibliography. In: Ribeiro, C., Hansen, P. (eds.) Essays and Surveys on Metaheuristics, pp. 325–367. Kluwer Academic Publishers, London (2002)

    Chapter  Google Scholar 

  9. Festa, P., Resende, M.: An annotated bibliography of GRASP - part I: algorithms. Int. Trans. Oper. Res. 16(1), 1–24 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  10. Festa, P., Resende, M.: An annotated bibliography of GRASP - part II: applications. Int. Trans. Oper. Res. 16(2), 131–172 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  11. Goldengorin, B., Kocheturov, A., Pardalos, P.M.: A pseudo-boolean approach to the market graph analysis by means of the p-median model. In: Aleskerov, F., Goldengorin, B., Pardalos, P.M. (eds.) Clusters, Orders, and Trees: Methods and Applications. SOIA, vol. 92, pp. 77–89. Springer, New York (2014). doi:10.1007/978-1-4939-0742-7_5

    Google Scholar 

  12. Goldengorin, B., Krushinsky, D., Pardalos, P.M.: Application of the PMP to cell formation in group technology. In: Goldengorin, B., Krushinsky, D., Pardalos, P.M. (eds.) Cell Formation in Industrial Engineering. SOIA, vol. 79, pp. 75–99. Springer, New York (2013). doi:10.1007/978-1-4614-8002-0_3

    Chapter  Google Scholar 

  13. Hakimi, S.: Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. 12(3), 450–459 (1964)

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  15. Hochbaum, D., Shmoys, D.: A best possible heuristic for the \(k\)-Center problem. Math. Oper. Res. 10(2), 180–184 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  16. Kariv, O., Hakimi, S.: An algorithmic approach to network location problems. Part I: the \(p\)-centers. SIAM J. Appl. Math. 37(3), 513–538 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  17. Kariv, O., Hakimi, S.: An algorithmic approach to network location problems. Part II: the \(p\)-medians. SIAM J. Appl. Math. 37(3), 539–560 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  18. Martinich, J.S.: A vertex-closing approach to the \(p\)-center problem. Nav. Res. Logist. 35(2), 185–201 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  19. Matsumoto, M., Nishimura, T.: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8(1), 3–30 (1998)

    Article  MATH  Google Scholar 

  20. Minieka, E.: The \(m\)-center problem. SIAM Rev. 12(1), 138–139 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  21. Mladenović, N., Labbé, M., Hansen, P.: Solving the \(p\)-center problem with Tabu Search and variable neighborhood search. Networks 42(April), 48–64 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  22. Mladenovic, N., Urosevic, D., Prez-Brito, D., Garca-Gonzlez, C.G.: Variable neighbourhood search for bandwidth reduction. Eur. J. Oper. Res. 200(1), 14–27 (2010)

    Article  MathSciNet  Google Scholar 

  23. Pardo, E.G., Mladenovi, N., Pantrigo, J.J., Duarte, A.: Variable formulation search for the cutwidth minimization problem. Appl. Soft Comput. 13(5), 2242–2252 (2013)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  26. Salhi, S., Al-Khedhairi, A.: Integrating heuristic information into exact methods: the case of the vertex p-centre problem. J. Oper. Res. Soc. 61(11), 1619–1631 (2010)

    Article  MATH  Google Scholar 

  27. Wilcoxon, F.: Individual comparisons by ranking methods. Biom. Bull. 1(6), 80–83 (1945)

    Article  Google Scholar 

Download references

Acknowledgements

This work has been realized thanks to the use of the S.Co.P.E. computing infrastructure at the University of Napoli FEDERICO II.

Author information

Authors and Affiliations

  1. Department of Mathematics and Applications, University of Napoli Federico II, Compl. MSA, Via Cintia, 80126, Naples, Italy

    Daniele Ferone, Paola Festa & Antonio Napoletano

  2. Mathematical Optimization and Planning, Amazon.com, Seattle, USA

    Mauricio G. C. Resende

Authors
  1. Daniele Ferone
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paola Festa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Antonio Napoletano
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mauricio G. C. Resende
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Paola Festa .

Editor information

Editors and Affiliations

  1. University of Trento, Trento, Italy

    Roberto Battiti

  2. University of Calabria, Rende, Italy

    Dmitri E. Kvasov

  3. University of Calabria, Rende, Italy

    Yaroslav D. Sergeyev

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Ferone, D., Festa, P., Napoletano, A., Resende, M.G.C. (2017). A New Local Search for the p-Center Problem Based on the Critical Vertex Concept. In: Battiti, R., Kvasov, D., Sergeyev, Y. (eds) Learning and Intelligent Optimization. LION 2017. Lecture Notes in Computer Science(), vol 10556. Springer, Cham. https://doi.org/10.1007/978-3-319-69404-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69404-7_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69403-0

  • Online ISBN: 978-3-319-69404-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation