Skip to main content
SpringerLink
Log in

A K-Means Grasshopper Optimisation Algorithm Applied to the Set Covering Problem

  • Conference paper
  • First Online:
Artificial Intelligence and Bioinspired Computational Methods (CSOC 2020)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1225))

Included in the following conference series:

Abstract

Many of the problems addressed at the industrial level are of a combinatorial type and a sub-assembly not less than these are of the NP-hard type. The design of algorithms that solve combinatorial problems based on the continuous metaheuristic of swarm intelligence is an area of interest at an industrial level. In this article, we explore a general binarization mechanism of continuous metaheuristics based on the k-means technique. In particular, we apply the k-means technique to the Grasshopper optimization algorithm in order to solve the set covering problem (SCP). The experiments are designed with the aim of demonstrating the usefulness of the k-means technique in binarization. Additionally, we verify the effectiveness of our algorithm through reference instances. The results indicate the K-means binary grasshopper optimization algorithm (KBGOA) obtains adequate results when evaluated with a combinatorial problem such as the SCP.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Khatibinia, M., Yazdani, H.: Accelerated multi-gravitational search algorithm for size optimization of truss structures. Swarm Evol. Comput. 38, 109–119 (2017)

    Article  Google Scholar 

  2. Barman, S., Kwon, Y.-K.: A novel mutual information-based boolean network inference method from time-series gene expression data. PloS One 12(2), e0171097 (2017)

    Article  Google Scholar 

  3. Crawford, B., Soto, R., Monfroy, E., Astorga, G., García, J., Cortes, E.: A meta-optimization approach for covering problems in facility location. In: Workshop on Engineering Applications, pp. 565–578. Springer (2017)

    Google Scholar 

  4. García, J., Crawford, B., Soto, R., Astorga, G.: A percentile transition ranking algorithm applied to binarization of continuous swarm intelligence metaheuristics. In: International Conference on Soft Computing and Data Mining

    Google Scholar 

  5. Garcia, J., Crawford, B., Soto, R., Astorga, G.: A percentile transition ranking algorithm applied to knapsack problem. In: Proceedings of the Computational Methods in Systems and Software, pp. 126–138. Springer (2017)

    Google Scholar 

  6. García, J., Altimiras, F., Peña, A., Astorga, G., Peredo, O.: A binary cuckoo search big data algorithm applied to large-scale crew scheduling problems. Complexity 2018 (2018)

    Google Scholar 

  7. García, J., Lalla-Ruiz, E., Voß, S., Droguett, E.L.: Enhancing a machine learning binarization framework by perturbation operators: analysis on the multidimensional knapsack problem. Int. J. Mach. Learn. Cybern. 1–20 (2020)

    Google Scholar 

  8. García, J., Crawford, B., Soto, R., García, P.: A multi dynamic binary black hole algorithm applied to set covering problem. In: International Conference on Harmony Search Algorithm, pp. 42–51. Springer (2017)

    Google Scholar 

  9. García, J., Crawford, B., Soto, R., Astorga, G.: A clustering algorithm applied to the binarization of swarm intelligence continuous metaheuristics. Swarm Evol. Comput. 44, 646–664 (2019)

    Article  Google Scholar 

  10. Crawford, B., Soto, R., Astorga, G., García, J.: Constructive metaheuristics for the set covering problem. In: International Conference on Bioinspired Methods and Their Applications, pp. 88–99. Springer (2018)

    Google Scholar 

  11. García, J., Peña, A.: Robust optimization: concepts and applications. In: Nature-Inspired Methods for Stochastic, Robust and Dynamic Optimization, p. 7 (2018)

    Google Scholar 

  12. Astorga, G., Crawford, B., Soto, R., Monfroy, E., García, J., Cortes, E.: A meta-optimization approach to solve the set covering problem. Ingeniería 23(3), 274–288 (2018)

    Article  Google Scholar 

  13. García, J., Moraga, P., Valenzuela, M., Crawford, B., Soto, R., Pinto, H., Peña, A., Altimiras, F., Astorga, G.: A DB-scan binarization algorithm applied to matrix covering problems. Comput. Intell. Neurosci. 2019 (2019)

    Google Scholar 

  14. Garcia, J., Măntoiu, M.: Localization results for zero order pseudodifferential operators. J. Pseudo Diff. Oper. Appl. 5(2), 255–276 (2014)

    Article  MathSciNet  Google Scholar 

  15. Yang, X.-S., Deb, S.: Cuckoo search via lévy flights. In: World Congress on Nature & Biologically Inspired Computing. NaBIC 2009, pp. 210–214. IEEE (2009)

    Google Scholar 

  16. Hatamlou, A.: Black hole: a new heuristic optimization approach for data clustering. Inf. Sci. 222, 175–184 (2013)

    Article  MathSciNet  Google Scholar 

  17. Yang, X.-S.: A new metaheuristic bat-inspired algorithm. In: Nature inspired cooperative strategies for optimization (NICSO 2010), pp. 65–74 (2010)

    Google Scholar 

  18. Saremi, S., Mirjalili, S., Lewis, A.: Grasshopper optimisation algorithm: theory and application. Adv. Eng. Softw. 105, 30–47 (2017)

    Article  Google Scholar 

  19. Franceschetti, A., Demir, E., Honhon, D., Van Woensel, T., Laporte, G., Stobbe, M.: A metaheuristic for the time-dependent pollution-routing problem. Eur. J. Oper. Res. 259(3), 972–991 (2017)

    Article  MathSciNet  Google Scholar 

  20. Crawford, B., Soto, R., Astorga, G., García, J., Castro, C., Paredes, F.: Putting continuous metaheuristics to work in binary search spaces. Complexity 2017 (2017)

    Google Scholar 

  21. Balaji, S., Revathi, N.: A new approach for solving set covering problem using jumping particle swarm optimization method. Nat. Comput. 15(3), 503–517 (2016)

    Article  MathSciNet  Google Scholar 

  22. Gary, M.R., Johnson, D.S.: Computers and intractability. A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    Google Scholar 

  23. Lu, Y., Vasko, F.J.: An or practitioner’s solution approach for the set covering problem. Int. J. Appl. Metaheuristic Comput. (IJAMC) 6(4), 1–13 (2015)

    Article  Google Scholar 

  24. Li, Y., Cai, Z.: Gravity-based heuristic for set covering problems and its application in fault diagnosis. J. Syst. Eng. Electr. 23(3), 391–398 (2012)

    Article  Google Scholar 

  25. Kasirzadeh, A., Saddoune, M., Soumis, F.: Airline crew scheduling: models, algorithms, and data sets. Euro. J. Trans. Logist. 6(2), 111–137 (2017)

    Article  Google Scholar 

  26. Horváth, M.: Computing strong lower and upper bounds for the integrated multi-pledepot vehicle and crew scheduling problem with branch-and-price. CEJOR 27, 39–67 (2017)

    Article  Google Scholar 

  27. Stojković, M.: The operational flight and multi-crew scheduling problem. Yugoslav J. Oper. Res. 15(1), 25–48 (2016)

    Article  MathSciNet  Google Scholar 

  28. García, J., Crawford, B., Soto, R., Carlos, C., Paredes, F.: A k-means binarization framework applied to multidimensional knapsack problem. Appl. Intell. 48, 357–380 (2017)

    Article  Google Scholar 

  29. García, J., Pope, C., Altimiras, F.: A distributed k-means segmentation algorithm applied to Lobesia botrana recognition. Complexity 2017 (2017)

    Google Scholar 

  30. Graells-Garrido, E., García, J.: Visual exploration of urban dynamics using mobile data. In: International Conference on Ubiquitous Computing and Ambient Intelligence, pp. 480–491. Springer (2015)

    Google Scholar 

  31. Graells-Garrido, E., Peredo, O., García, J.: Sensing urban patterns with antenna mappings: the case of Santiago, Chile. Sensors 16(7), 1098 (2016)

    Article  Google Scholar 

  32. Peredo, O.F., García, J.A., Stuven, R., Ortiz, J.M.: Urban dynamic estimation using mobile phone logs and locally varying anisotropy. In: Geostatistics Valencia 2016, pp. 949–964. Springer (2017)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Escuela de ingeniería en construcción, Pontificia Universidad Católica de Valparaíso, Valparaíso, Chile

    Gabriel Villavicencio, Matias Valenzuela, Paola Moraga & Hernan Pinto

  2. Facultad de Ingeniería y Negocios, Universidad de las Américas, Santiago, Chile

    Francisco Altimiras

Authors
  1. Gabriel Villavicencio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matias Valenzuela
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Francisco Altimiras
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Paola Moraga
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Hernan Pinto
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gabriel Villavicencio .

Editor information

Editors and Affiliations

  1. Tomas Bata University, Zlín, Czech Republic

    Radek Silhavy

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Villavicencio, G., Valenzuela, M., Altimiras, F., Moraga, P., Pinto, H. (2020). A K-Means Grasshopper Optimisation Algorithm Applied to the Set Covering Problem. In: Silhavy, R. (eds) Artificial Intelligence and Bioinspired Computational Methods. CSOC 2020. Advances in Intelligent Systems and Computing, vol 1225. Springer, Cham. https://doi.org/10.1007/978-3-030-51971-1_25

Download citation

Publish with us

Policies and ethics

Search

Navigation