Skip to main content
SpringerLink
Log in

Variable Neighborhood Descent for the Capacitated Clustering Problem

  • Conference paper
  • First Online:
Discrete Optimization and Operations Research (DOOR 2016)

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

Abstract

In this paper we propose a Variable neighborhood descent based heuristic for the capacitated clustering problem and related handover minimization problem. The performance of the proposed approach is assessed on benchmark instances from the literature. The obtained results confirm that of our approach is highly competitive with the state-of-the-art methods, significantly outperforming all of them on the set of randomly-generated instances tested.

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

Access this chapter

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

Institutional subscriptions

References

  1. Brimberg, J., Mladenović, N., Urošević, D.: Solving the maximally diverse grouping problem by skewed general variable neighborhood search. Inf. Sci. 295, 650–675 (2015)

    Article  Google Scholar 

  2. Deng, Y., Bard, J.F.: A reactive grasp with path relinking for capacitated clustering. J. Heuristics 17(2), 119–152 (2011)

    Article  MATH  Google Scholar 

  3. Fan, Z., Chen, Y., Ma, J., Zeng, S.: A hybrid genetic algorithmic approach to the maximally diverse grouping problem. J. Oper. Res. Soc. 62(1), 92–99 (2011)

    Article  Google Scholar 

  4. Feo, T.A., Khellaf, M.: A class of bounded approximation algorithms for graph partitioning. Networks 20(2), 181–195 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  5. Gallego, M., Laguna, M., Martí, R., Duarte, A.: Tabu search with strategic oscillation for the maximally diverse grouping problem. J. Oper. Res. Soc. 64(5), 724–734 (2012)

    Article  Google Scholar 

  6. Martínez-Gavara, A., Campos, V., Gallego, M., Laguna, M., Martí, R.: Tabu search and grasp for the capacitated clustering problem. Comput. Optim. Appl. 62(2), 589–607 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  7. Mjirda, A., Todosijević, R., Hanafi, S., Hansen, P., Mladenović, N.: Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem. Int. Trans. Oper. Res. (2016). doi:10.1111/itor.12282

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Morán-Mirabal, L., González-Velarde, J., Resende, M.G., Silva, R.M.: Randomized heuristics for handover minimization in mobility networks. J. Heuristics 19(6), 845–880 (2013)

    Article  Google Scholar 

  10. Rodriguez, F., Lozano, M., García-Martínez, C., González-Barrera, J.: An artificial bee colony algorithm for the maximally diverse grouping problem. Inf. Sci. 230, 183–196 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  11. Urošević, D.: Variable neighborhood search for maximum diverse grouping problem. Yugoslav J. Oper. Res. 24(1), 21–33 (2014)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Royal Military College of Canada, Kingston, ON, Canada

    Jack Brimberg

  2. Mathematical Institute SANU, Belgrade, Serbia

    Nenad Mladenović, Raca Todosijević & Dragan Urošević

  3. LAMIH-UVHC, Le Mont Houy Valenciennes, Cedex 9, France

    Nenad Mladenović

Authors
  1. Jack Brimberg
    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

  3. Raca Todosijević
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dragan Urošević
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dragan Urošević .

Editor information

Editors and Affiliations

  1. Sobolev Institute of Mathematics , Novosibirsk, Russia

    Yury Kochetov

  2. Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia

    Michael Khachay

  3. Sobolev Institute of Mathematics , Novosibirsk, Russia

    Vladimir Beresnev

  4. Far Eastern Federal University , Vladivostik, Russia

    Evgeni Nurminski

  5. University of Florida , Gainesville, Florida, USA

    Panos Pardalos

Appendix

Appendix

Here we present detailed results obtained by all considered methods. For RanRail instances, a larger value indicates a better solution, while for Handover instances the smaller values are better (Tables 6, 7, 8, 9 and 10).

Table 6. Detailed results for Random real instances with 240 elements
Full size table
Table 7. Detailed results for Random real instances with 480 elements
Full size table
Table 8. Detailed results for Sparse instances
Full size table
Table 9. Detailed results for Handover instances - Part I
Full size table
Table 10. Detailed results for Handover instances - Part II
Full size table

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Brimberg, J., Mladenović, N., Todosijević, R., Urošević, D. (2016). Variable Neighborhood Descent for the Capacitated Clustering Problem. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds) Discrete Optimization and Operations Research. DOOR 2016. Lecture Notes in Computer Science(), vol 9869. Springer, Cham. https://doi.org/10.1007/978-3-319-44914-2_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44914-2_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44913-5

  • Online ISBN: 978-3-319-44914-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation