{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:46:35Z","timestamp":1742935595756,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"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_14","type":"book-chapter","created":{"date-parts":[[2020,8,8]],"date-time":"2020-08-08T17:03:00Z","timestamp":1596906180000},"page":"172-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Binary Bat Algorithm Applied to Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Lorena","family":"Jorquera","sequence":"first","affiliation":[]},{"given":"Gabriel","family":"Villavicencio","sequence":"additional","affiliation":[]},{"given":"Leonardo","family":"Causa","sequence":"additional","affiliation":[]},{"given":"Luis","family":"Lopez","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9s","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,9]]},"reference":[{"issue":"2","key":"14_CR1","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":"14_CR2","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. 88\u201399. Springer, Cham (2018)","DOI":"10.1007\/978-3-319-91641-5_8"},{"key":"14_CR3","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. 3\u201313. Springer, Cham (2018)","DOI":"10.1007\/978-3-319-72550-5_1"},{"key":"14_CR4","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. 565\u2013578. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-66963-2_50"},{"key":"14_CR5","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). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S221065021730528X"},{"key":"14_CR6","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. 126\u2013138. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-67621-0_11"},{"key":"14_CR7","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) (2018)","DOI":"10.14483\/23448393.13247"},{"key":"14_CR8","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":"14_CR9","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. 7 (2018)","DOI":"10.5772\/intechopen.75381"},{"key":"14_CR10","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. 42\u201351. Springer, Singapore (2017)","DOI":"10.1007\/978-981-10-3728-3_6"},{"key":"14_CR11","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"},{"issue":"3","key":"14_CR12","first-page":"274","volume":"23","author":"B Crawford","year":"2018","unstructured":"Crawford, B., Soto, R., Monfroy, E., Astorga, G., 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":"14_CR13","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"},{"key":"14_CR14","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":"14_CR15","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10489-017-0972-6","volume":"48","author":"J Garc\u00eda","year":"2018","unstructured":"Garc\u00eda, J., Crawford, B., Soto, R., Castro, C., Paredes, F.: A k-means binarization framework applied to multidimensional knapsack problem. Appl. Intell. 48(2), 357\u2013380 (2018)","journal-title":"Appl. Intell."},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.asoc.2016.02.027","volume":"43","author":"X Zhang","year":"2016","unstructured":"Zhang, X., Wu, C., Li, J., Wang, X., Yang, Z., Lee, J.-M., Jung, K.-H.: Binary artificial algae algorithm for multidimensional knapsack problems. Appl. Soft Comput. 43, 583\u2013595 (2016)","journal-title":"Appl. Soft Comput."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.engappai.2016.05.006","volume":"55","author":"B Haddar","year":"2016","unstructured":"Haddar, B., Khemakhem, M., Hanafi, S., Wilbaut, C.: A hybrid quantum particle swarm optimization for the multidimensional knapsack problem. Eng. Appl. Artif. Intell. 55, 1\u201313 (2016)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.asoc.2016.11.023","volume":"50","author":"T Meng","year":"2017","unstructured":"Meng, T., Pan, Q.-K.: An improved fruit fly optimization algorithm for solving the multidimensional knapsack problem. Appl. Soft Comput. 50, 79\u201393 (2017)","journal-title":"Appl. Soft Comput."},{"issue":"23\u201324","key":"14_CR19","doi-asserted-by":"publisher","first-page":"9788","DOI":"10.1016\/j.apm.2016.06.002","volume":"40","author":"J Liu","year":"2016","unstructured":"Liu, J., Wu, C., Cao, J., Wang, X., Teo, K.L.: A binary differential search algorithm for the 0\u20131 multidimensional knapsack problem. Appl. Math. Model. 40(23\u201324), 9788\u20139805 (2016)","journal-title":"Appl. Math. Model."},{"key":"14_CR20","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":"14_CR21","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. 480\u2013491. Springer, Cham (2015)","DOI":"10.1007\/978-3-319-26401-1_45"},{"issue":"2","key":"14_CR22","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":"7","key":"14_CR23","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":"14_CR24","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. 949\u2013964. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-46819-8_66"},{"issue":"2","key":"14_CR25","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/1520-6750(198704)34:2<161::AID-NAV3220340203>3.0.CO;2-A","volume":"34","author":"H Pirkul","year":"1987","unstructured":"Pirkul, H.: A heuristic solution procedure for the multiconstraint zero? One knapsack problem. Naval Res. Logist. 34(2), 161\u2013172 (1987)","journal-title":"Naval Res. Logist."},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.cor.2015.04.018","volume":"63","author":"X Kong","year":"2015","unstructured":"Kong, X., Gao, L., Ouyang, H., Li, S.: Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm. Comput. Oper. Res. 63, 7\u201322 (2015)","journal-title":"Comput. Oper. Res."}],"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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T19:13:59Z","timestamp":1618254839000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-51971-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030519704","9783030519711"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51971-1_14","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"}}]}}