{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:26:00Z","timestamp":1743056760509,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030519704"},{"type":"electronic","value":"9783030519711"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-51971-1_25","type":"book-chapter","created":{"date-parts":[[2020,8,8]],"date-time":"2020-08-08T17:03:00Z","timestamp":1596906180000},"page":"312-323","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A K-Means Grasshopper Optimisation Algorithm Applied to the Set Covering Problem"],"prefix":"10.1007","author":[{"given":"Gabriel","family":"Villavicencio","sequence":"first","affiliation":[]},{"given":"Matias","family":"Valenzuela","sequence":"additional","affiliation":[]},{"given":"Francisco","family":"Altimiras","sequence":"additional","affiliation":[]},{"given":"Paola","family":"Moraga","sequence":"additional","affiliation":[]},{"given":"Hernan","family":"Pinto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,9]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.swevo.2017.07.001","volume":"38","author":"M Khatibinia","year":"2017","unstructured":"Khatibinia, M., Yazdani, H.: Accelerated multi-gravitational search algorithm for size optimization of truss structures. Swarm Evol. Comput. 38, 109\u2013119 (2017)","journal-title":"Swarm Evol. Comput."},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"e0171097","DOI":"10.1371\/journal.pone.0171097","volume":"12","author":"S Barman","year":"2017","unstructured":"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)","journal-title":"PloS One"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Monfroy, E., Astorga, G., Garc\u00eda, J., Cortes, E.: A meta-optimization approach for covering problems in facility location. In: Workshop on Engineering Applications, pp.\u00a0565\u2013578. Springer (2017)","DOI":"10.1007\/978-3-319-66963-2_50"},{"key":"25_CR4","unstructured":"Garc\u00eda, 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"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"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.\u00a0126\u2013138. Springer (2017)","DOI":"10.1007\/978-3-319-67621-0_11"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Garc\u00eda, J., Altimiras, F., Pe\u00f1a, A., Astorga, G., Peredo, O.: A binary cuckoo search big data algorithm applied to large-scale crew scheduling problems. Complexity 2018 (2018)","DOI":"10.1155\/2018\/8395193"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Garc\u00eda, J., Lalla-Ruiz, E., Vo\u00df, 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\u201320 (2020)","DOI":"10.1007\/s13042-020-01085-8"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Garc\u00eda, J., Crawford, B., Soto, R., Garc\u00eda, P.: A multi dynamic binary black hole algorithm applied to set covering problem. In: International Conference on Harmony Search Algorithm, pp.\u00a042\u201351. Springer (2017)","DOI":"10.1007\/978-981-10-3728-3_6"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1016\/j.swevo.2018.08.006","volume":"44","author":"J Garc\u00eda","year":"2019","unstructured":"Garc\u00eda, J., Crawford, B., Soto, R., Astorga, G.: A clustering algorithm applied to the binarization of swarm intelligence continuous metaheuristics. Swarm Evol. Comput. 44, 646\u2013664 (2019)","journal-title":"Swarm Evol. Comput."},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Astorga, G., Garc\u00eda, J.: Constructive metaheuristics for the set covering problem. In: International Conference on Bioinspired Methods and Their Applications, pp.\u00a088\u201399. Springer (2018)","DOI":"10.1007\/978-3-319-91641-5_8"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Garc\u00eda, J., Pe\u00f1a, A.: Robust optimization: concepts and applications. In: Nature-Inspired Methods for Stochastic, Robust and Dynamic Optimization, p.\u00a07 (2018)","DOI":"10.5772\/intechopen.75381"},{"issue":"3","key":"25_CR12","doi-asserted-by":"publisher","first-page":"274","DOI":"10.14483\/23448393.13247","volume":"23","author":"G Astorga","year":"2018","unstructured":"Astorga, G., Crawford, B., Soto, R., Monfroy, E., Garc\u00eda, J., Cortes, E.: A meta-optimization approach to solve the set covering problem. Ingenier\u00eda 23(3), 274\u2013288 (2018)","journal-title":"Ingenier\u00eda"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Garc\u00eda, J., Moraga, P., Valenzuela, M., Crawford, B., Soto, R., Pinto, H., Pe\u00f1a, A., Altimiras, F., Astorga, G.: A DB-scan binarization algorithm applied to matrix covering problems. Comput. Intell. Neurosci. 2019 (2019)","DOI":"10.1155\/2019\/3238574"},{"issue":"2","key":"25_CR14","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s11868-013-0084-y","volume":"5","author":"J Garcia","year":"2014","unstructured":"Garcia, J., M\u0103ntoiu, M.: Localization results for zero order pseudodifferential operators. J. Pseudo Diff. Oper. Appl. 5(2), 255\u2013276 (2014)","journal-title":"J. Pseudo Diff. Oper. Appl."},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Yang, X.-S., Deb, S.: Cuckoo search via l\u00e9vy flights. In: World Congress on Nature & Biologically Inspired Computing. NaBIC 2009, pp.\u00a0210\u2013214. IEEE (2009)","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ins.2012.08.023","volume":"222","author":"A Hatamlou","year":"2013","unstructured":"Hatamlou, A.: Black hole: a new heuristic optimization approach for data clustering. Inf. Sci. 222, 175\u2013184 (2013)","journal-title":"Inf. Sci."},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Yang, X.-S.: A new metaheuristic bat-inspired algorithm. In: Nature inspired cooperative strategies for optimization (NICSO 2010), pp.\u00a065\u201374 (2010)","DOI":"10.1007\/978-3-642-12538-6_6"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.advengsoft.2017.01.004","volume":"105","author":"S Saremi","year":"2017","unstructured":"Saremi, S., Mirjalili, S., Lewis, A.: Grasshopper optimisation algorithm: theory and application. Adv. Eng. Softw. 105, 30\u201347 (2017)","journal-title":"Adv. Eng. Softw."},{"issue":"3","key":"25_CR19","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1016\/j.ejor.2016.11.026","volume":"259","author":"A Franceschetti","year":"2017","unstructured":"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\u2013991 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Astorga, G., Garc\u00eda, J., Castro, C., Paredes, F.: Putting continuous metaheuristics to work in binary search spaces. Complexity 2017 (2017)","DOI":"10.1155\/2017\/8404231"},{"issue":"3","key":"25_CR21","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s11047-015-9509-2","volume":"15","author":"S Balaji","year":"2016","unstructured":"Balaji, S., Revathi, N.: A new approach for solving set covering problem using jumping particle swarm optimization method. Nat. Comput. 15(3), 503\u2013517 (2016)","journal-title":"Nat. Comput."},{"key":"25_CR22","volume-title":"Computers and intractability. A Guide to the Theory of NP-Completeness","author":"MR Gary","year":"1979","unstructured":"Gary, M.R., Johnson, D.S.: Computers and intractability. A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"issue":"4","key":"25_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/IJAMC.2015100101","volume":"6","author":"Y Lu","year":"2015","unstructured":"Lu, Y., Vasko, F.J.: An or practitioner\u2019s solution approach for the set covering problem. Int. J. Appl. Metaheuristic Comput. (IJAMC) 6(4), 1\u201313 (2015)","journal-title":"Int. J. Appl. Metaheuristic Comput. (IJAMC)"},{"issue":"3","key":"25_CR24","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1109\/JSEE.2012.00049","volume":"23","author":"Y Li","year":"2012","unstructured":"Li, Y., Cai, Z.: Gravity-based heuristic for set covering problems and its application in fault diagnosis. J. Syst. Eng. Electr. 23(3), 391\u2013398 (2012)","journal-title":"J. Syst. Eng. Electr."},{"issue":"2","key":"25_CR25","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s13676-015-0080-x","volume":"6","author":"A Kasirzadeh","year":"2017","unstructured":"Kasirzadeh, A., Saddoune, M., Soumis, F.: Airline crew scheduling: models, algorithms, and data sets. Euro. J. Trans. Logist. 6(2), 111\u2013137 (2017)","journal-title":"Euro. J. Trans. Logist."},{"key":"25_CR26","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10100-017-0489-4","volume":"27","author":"M Horv\u00e1th","year":"2017","unstructured":"Horv\u00e1th, M.: Computing strong lower and upper bounds for the integrated multi-pledepot vehicle and crew scheduling problem with branch-and-price. CEJOR 27, 39\u201367 (2017)","journal-title":"CEJOR"},{"issue":"1","key":"25_CR27","doi-asserted-by":"publisher","first-page":"25","DOI":"10.2298\/YJOR0501025S","volume":"15","author":"M Stojkovi\u0107","year":"2016","unstructured":"Stojkovi\u0107, M.: The operational flight and multi-crew scheduling problem. Yugoslav J. Oper. Res. 15(1), 25\u201348 (2016)","journal-title":"Yugoslav J. Oper. Res."},{"key":"25_CR28","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10489-017-0972-6","volume":"48","author":"J Garc\u00eda","year":"2017","unstructured":"Garc\u00eda, J., Crawford, B., Soto, R., Carlos, C., Paredes, F.: A k-means binarization framework applied to multidimensional knapsack problem. Appl. Intell. 48, 357\u2013380 (2017)","journal-title":"Appl. Intell."},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Garc\u00eda, J., Pope, C., Altimiras, F.: A distributed k-means segmentation algorithm applied to Lobesia botrana recognition. Complexity 2017 (2017)","DOI":"10.1155\/2017\/5137317"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Graells-Garrido, E., Garc\u00eda, J.: Visual exploration of urban dynamics using mobile data. In: International Conference on Ubiquitous Computing and Ambient Intelligence, pp.\u00a0480\u2013491. Springer (2015)","DOI":"10.1007\/978-3-319-26401-1_45"},{"issue":"7","key":"25_CR31","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.3390\/s16071098","volume":"16","author":"E Graells-Garrido","year":"2016","unstructured":"Graells-Garrido, E., Peredo, O., Garc\u00eda, J.: Sensing urban patterns with antenna mappings: the case of Santiago, Chile. Sensors 16(7), 1098 (2016)","journal-title":"Sensors"},{"key":"25_CR32","doi-asserted-by":"crossref","unstructured":"Peredo, O.F., Garc\u00eda, J.A., Stuven, R., Ortiz, J.M.: Urban dynamic estimation using mobile phone logs and locally varying anisotropy. In: Geostatistics Valencia 2016, pp.\u00a0949\u2013964. Springer (2017)","DOI":"10.1007\/978-3-319-46819-8_66"}],"container-title":["Advances in Intelligent Systems and Computing","Artificial Intelligence and Bioinspired Computational Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51971-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T19:20:14Z","timestamp":1618255214000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-51971-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030519704","9783030519711"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51971-1_25","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSOC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Computer Science On-line Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zlin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csolc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/csoc.openpublish.eu","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}