{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:35:45Z","timestamp":1743053745615,"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_19","type":"book-chapter","created":{"date-parts":[[2020,8,8]],"date-time":"2020-08-08T17:03:00Z","timestamp":1596906180000},"page":"234-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A K-means Grasshopper Algorithm Applied to the Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Hernan","family":"Pinto","sequence":"first","affiliation":[]},{"given":"Alvaro","family":"Pe\u00f1a","sequence":"additional","affiliation":[]},{"given":"Leonardo","family":"Causa","sequence":"additional","affiliation":[]},{"given":"Mat\u00edas","family":"Valenzuela","sequence":"additional","affiliation":[]},{"given":"Gabriel","family":"Villavicencio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,9]]},"reference":[{"issue":"2","key":"19_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":"19_CR2","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":"19_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.\u00a03\u201313. Springer, Cham (2018)","DOI":"10.1007\/978-3-319-72550-5_1"},{"key":"19_CR4","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, Cham (2017)","DOI":"10.1007\/978-3-319-67621-0_11"},{"key":"19_CR5","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":"19_CR6","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":"19_CR7","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":"19_CR8","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":"19_CR9","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, Singapore (2018)","DOI":"10.1007\/978-3-319-91641-5_8"},{"key":"19_CR10","first-page":"7","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, p. 7. IntechOpen, London (2018)"},{"key":"19_CR11","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":"19_CR12","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."},{"issue":"2","key":"19_CR13","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."},{"key":"19_CR14","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."},{"key":"19_CR15","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":"19_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":"19_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."},{"issue":"2","key":"19_CR18","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":"19_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, 9788\u20139805 (2016)","journal-title":"Appl. Math. Model."},{"issue":"22","key":"19_CR20","first-page":"11042","volume":"218","author":"JC Bansal","year":"2012","unstructured":"Bansal, J.C., Deep, K.: A modified binary particle swarm optimization for knapsack problems. Appl. Math. Comput. 218(22), 11042\u201311061 (2012)","journal-title":"Appl. Math. Comput."},{"key":"19_CR21","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":"19_CR22","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"},{"key":"19_CR23","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1007\/978-3-319-46819-8_66","volume-title":"Geostatistics Valencia 2016","author":"OF Peredo","year":"2017","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. 949\u2013964. Springer, Cham (2017)"},{"issue":"7","key":"19_CR24","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"},{"issue":"2","key":"19_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":"19_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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T19:17:25Z","timestamp":1618255045000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-51971-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030519704","9783030519711"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51971-1_19","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"}}]}}