{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:46:20Z","timestamp":1743014780161,"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_18","type":"book-chapter","created":{"date-parts":[[2020,8,8]],"date-time":"2020-08-08T17:03:00Z","timestamp":1596906180000},"page":"223-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Percentil Bat Algorithm an Application to the Set Covering Problem"],"prefix":"10.1007","author":[{"given":"Lorena","family":"Jorquera","sequence":"first","affiliation":[]},{"given":"Pamela","family":"Valenzuela","sequence":"additional","affiliation":[]},{"given":"Francisco","family":"Altimiras","sequence":"additional","affiliation":[]},{"given":"Paola","family":"Moraga","sequence":"additional","affiliation":[]},{"given":"Gabriel","family":"Villavicencio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,9]]},"reference":[{"key":"18_CR1","unstructured":"Yang, X.-S., Deb, S.: Cuckoo search via l\u00e9vy flights. In: World Congress on Nature & Biologically Inspired Computing, 2009. NaBIC 2009, pp.\u00a0210\u2013214. IEEE (2009)"},{"key":"18_CR2","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":"18_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-12538-6_6","volume-title":"Nature inspired cooperative strategies for optimization (NICSO 2010)","author":"X-S Yang","year":"2010","unstructured":"Yang, X.-S.: A new metaheuristic bat-inspired algorithm. In: Gonz\u00e1ez, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds.) Nature inspired cooperative strategies for optimization (NICSO 2010), pp. 65\u201374. Springer, Berlin (2010)"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S.: Sca: a sine cosine algorithm for solving optimization problems. Knowl. Based Syst. 96, 120\u2013133 (2016)","journal-title":"Knowl. Based Syst."},{"key":"18_CR5","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":"18_CR6","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":"18_CR7","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, Cham (2017)","DOI":"10.1007\/978-3-319-66963-2_50"},{"key":"18_CR8","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, Cham (2018)","DOI":"10.1007\/978-3-319-91641-5_8"},{"key":"18_CR9","volume-title":"Nature-Inspired Methods for Stochastic, Robust and Dynamic Optimization","author":"J Garc\u00eda","year":"2018","unstructured":"Garc\u00eda, J., Pe\u00f1a, A.: Robust optimization: concepts and applications. In: Lorente, J.D.S., Osaba, E. (eds.) Nature-Inspired Methods for Stochastic, Robust and Dynamic Optimization. IntechOpen, London (2018)"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1155\/2019\/3238574","volume":"2019","author":"J Garc\u00eda","year":"2019","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, 16 (2019)","journal-title":"Comput. Intell. Neurosci."},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1155\/2018\/8395193","volume":"2018","author":"J Garc\u00eda","year":"2018","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, 15 (2018)","journal-title":"Complexity"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Garc\u00eda, 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, Cham (2017)","DOI":"10.1007\/978-3-319-67621-0_11"},{"key":"18_CR13","doi-asserted-by":"crossref","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)","DOI":"10.14483\/23448393.13247"},{"key":"18_CR14","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":"18_CR15","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, Cham (2017)","DOI":"10.1007\/978-981-10-3728-3_6"},{"key":"18_CR16","doi-asserted-by":"crossref","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, pp.\u00a03\u201313. Springer, Cham (2018)","DOI":"10.1007\/978-3-319-72550-5_1"},{"issue":"3","key":"18_CR17","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":"18_CR18","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1155\/2017\/8404231","volume":"2017","author":"B Crawford","year":"2017","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, 19 (2017)","journal-title":"Complexity"},{"key":"18_CR19","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."},{"issue":"2","key":"18_CR20","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 Differ. Oper. Appl. 5(2), 255\u2013276 (2014)","journal-title":"J. Pseudo Differ. Oper. Appl."},{"issue":"3","key":"18_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":"18_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. WH Freeman and Company, New York (1979)"},{"issue":"4","key":"18_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":"18_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. Electron. 23(3), 391\u2013398 (2012)","journal-title":"J. Syst. Eng. Electron."},{"issue":"2","key":"18_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. Transp. Logist. 6(2), 111\u2013137 (2017)","journal-title":"EURO J. Transp. Logist."},{"key":"18_CR26","first-page":"1","volume":"27","author":"M Horv\u00e1th","year":"2017","unstructured":"Horv\u00e1th, M., Kis, T.: Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price. CEJOR 27, 1\u201329 (2017)","journal-title":"CEJOR"},{"key":"18_CR27","first-page":"25","volume":"151","author":"M Stojkovi\u0107","year":"2016","unstructured":"Stojkovi\u0107, M.: The operational flight and multi-crew scheduling problem. Yugoslav J. Oper. Res. 151, 25\u201348 (2016)","journal-title":"Yugoslav J. Oper. Res."},{"issue":"2","key":"18_CR28","first-page":"1","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(2), 1\u201324 (2017)","journal-title":"Appl. Intell."},{"key":"18_CR29","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1155\/2017\/5137317","volume":"2017","author":"J Garc\u00eda","year":"2017","unstructured":"Garc\u00eda, J., Pope, C., Altimiras, F.: A distributed k-means segmentation algorithm applied to lobesia botrana recognition. Complexity 2017, 14 (2017)","journal-title":"Complexity"},{"key":"18_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, Cham (2015)","DOI":"10.1007\/978-3-319-26401-1_45"},{"issue":"7","key":"18_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":"18_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: G\u00f3mez-Hern\u00e1ndez, J., Rodrigo-Ilarri, J., Rodrigo-Clavero, M., Cassiraga, E., Vargas-Guzm\u00e1n, J., (eds.) Geostatistics Valencia 2016, pp.\u00a0949\u2013964, Springer, Cham (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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T19:18:12Z","timestamp":1618255092000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-51971-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030519704","9783030519711"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51971-1_18","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"}}]}}