{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:05:52Z","timestamp":1742929552101,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030956295"},{"type":"electronic","value":"9783030956301"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95630-1_16","type":"book-chapter","created":{"date-parts":[[2022,1,22]],"date-time":"2022-01-22T17:02:23Z","timestamp":1642870943000},"page":"227-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Population Size Management in a Cuckoo Search Algorithm Solving Combinatorial Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1617-0093","authenticated-orcid":false,"given":"Marcelo","family":"Ch\u00e1vez","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5500-0188","authenticated-orcid":false,"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5755-6929","authenticated-orcid":false,"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7232-0412","authenticated-orcid":false,"given":"Wenceslao","family":"Palma","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0426-0144","authenticated-orcid":false,"given":"Marcelo","family":"Becerra-Rozas","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7723-7012","authenticated-orcid":false,"given":"Felipe","family":"Cisternas-Caneo","sequence":"additional","affiliation":[]},{"given":"Gino","family":"Astorga","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3556-9331","authenticated-orcid":false,"given":"Sanjay","family":"Misra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,23]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Bujok, P., Tvrd\u00edk, J.: Enhanced individual-dependent differential evolution with population size adaptation. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 1358\u20131365. IEEE (2017)","DOI":"10.1109\/CEC.2017.7969462"},{"key":"16_CR2","unstructured":"Crawford, B., Le\u00f3n de la Barra, C.: Los algoritmos ambidiestros (2020). https:\/\/www.mercuriovalpo.cl\/impresa\/2020\/07\/13\/full\/cuerpo-principal\/15\/. Acceded 12 Feb 2021"},{"key":"16_CR3","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1155\/2017\/8404231","DOI":"10.1155\/2017\/8404231"},{"key":"16_CR4","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-030-85672-4_6","volume-title":"Optimization and Learning","author":"B Crawford","year":"2021","unstructured":"Crawford, B., et al.: A comparison of Learnheuristics using different Reward Functions to solve the Set Covering Problem. In: Dorronsoro, B., Amodeo, L., Pavone, M., Ruiz, P. (eds.) OLA 2021. CCIS, vol. 1443, pp. 74\u201385. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85672-4_6"},{"issue":"16","key":"16_CR5","doi-asserted-by":"publisher","first-page":"1839","DOI":"10.3390\/math9161839","volume":"9","author":"B Crawford","year":"2021","unstructured":"Crawford, B., et al.: Q-learnheuristics: towards data-driven balanced metaheuristics. Mathematics 9(16), 1839 (2021). https:\/\/doi.org\/10.3390\/math9161839","journal-title":"Mathematics"},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2480741.2480752","volume":"45","author":"M \u010crepin\u0161ek","year":"2013","unstructured":"\u010crepin\u0161ek, M., Liu, S.H., Mernik, M.: Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput. Surv. (CSUR) 45(3), 1\u201333 (2013)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"3","key":"16_CR7","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/s12530-019-09318-0","volume":"12","author":"KG Dhal","year":"2019","unstructured":"Dhal, K.G., Das, A., Sahoo, S., Das, R., Das, S.: Measuring the curse of population size over swarm intelligence based algorithms. Evol. Syst. 12(3), 779\u2013826 (2019). https:\/\/doi.org\/10.1007\/s12530-019-09318-0","journal-title":"Evol. Syst."},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.3390\/math7010017","volume":"7","author":"Y Feng","year":"2019","unstructured":"Feng, Y., An, H., Gao, X.: The importance of transfer function in solving set-union knapsack problem based on discrete moth search algorithm. Mathematics 7(1), 17 (2019)","journal-title":"Mathematics"},{"key":"16_CR9","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-21937-5_20","volume-title":"Recent Trends in Wireless and Mobile Networks","author":"A Gherboudj","year":"2011","unstructured":"Gherboudj, A., Chikhi, S.: BPSO algorithms for knapsack problem. In: \u00d6zcan, A., Zizka, J., Nagamalai, D. (eds.) CoNeCo\/WiMo -2011. CCIS, vol. 162, pp. 217\u2013227. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21937-5_20"},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1137\/1024022","volume":"24","author":"J Hartmanis","year":"1982","unstructured":"Hartmanis, J.: Computers and intractability: a guide to the theory of NP-completeness (Michael R. Garey and David S. Johnson). SIAM Rev. 24(1), 90 (1982)","journal-title":"SIAM Rev."},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"147596","DOI":"10.1109\/ACCESS.2019.2946664","volume":"7","author":"K Hussain","year":"2019","unstructured":"Hussain, K., Zhu, W., Mohd Salleh, M.N.: Long-term memory Harris\u2019 hawk optimization for high dimensional and optimal power flow problems. IEEE Access 7, 147596\u2013147616 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2946664","journal-title":"IEEE Access"},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Lanza-Gutierrez, J.M., Caballe, N., Crawford, B., Soto, R., Gomez-Pulido, J.A., Paredes, F.: Exploring further advantages in an alternative formulation for the set covering problem. Math. Probl. Eng. 2020 (2020). https:\/\/doi.org\/10.1155\/2020\/5473501","DOI":"10.1155\/2020\/5473501"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1007\/978-3-030-58817-5_65","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2020","author":"J Lemus-Romani","year":"2020","unstructured":"Lemus-Romani, J., et al.: Ambidextrous socio-cultural algorithms. In: Gervasi, O., et al. (eds.) ICCSA 2020. LNCS, vol. 12254, pp. 923\u2013938. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58817-5_65"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Limmer, S., Fey, D.: Investigation of strategies for an increasing population size in multi-objective CMA-ES. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 476\u2013483. IEEE (2016)","DOI":"10.1109\/CEC.2016.7743832"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"100671","DOI":"10.1016\/j.swevo.2020.100671","volume":"54","author":"B Morales-Casta\u00f1eda","year":"2020","unstructured":"Morales-Casta\u00f1eda, B., Zaldivar, D., Cuevas, E., Fausto, F., Rodr\u00edguez, A.: A better balance in metaheuristic algorithms: does it exist? Swarm Evol. Comput. 54, 100671 (2020)","journal-title":"Swarm Evol. Comput."},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"107389","DOI":"10.1016\/j.asoc.2021.107389","volume":"107","author":"B Morales-Casta\u00f1eda","year":"2021","unstructured":"Morales-Casta\u00f1eda, B., Zald\u00edvar, D., Cuevas, E., Rodr\u00edguez, A., Navarro, M.A.: Population management in metaheuristic algorithms: could less be more? Appl. Soft Comput. 107, 107389 (2021). https:\/\/doi.org\/10.1016\/j.asoc.2021.107389","journal-title":"Appl. Soft Comput."},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Olorunda, O., Engelbrecht, A.P.: Measuring exploration\/exploitation in particle swarms using swarm diversity. In: 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence), pp. 1128\u20131134. IEEE (2008)","DOI":"10.1109\/CEC.2008.4630938"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1016\/j.future.2018.08.002","volume":"93","author":"FB Ozsoydan","year":"2019","unstructured":"Ozsoydan, F.B., Baykasoglu, A.: A swarm intelligence-based algorithm for the set-union knapsack problem. Future Gener. Comput. Syst. 93, 560\u2013569 (2019)","journal-title":"Future Gener. Comput. Syst."},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-319-18833-1_10","volume-title":"Bioinspired Computation in Artificial Systems","author":"R Soto","year":"2015","unstructured":"Soto, R., Crawford, B., Olivares, R., Barraza, J., Johnson, F., Paredes, F.: A binary cuckoo search algorithm for solving the set covering problem. In: Ferr\u00e1ndez Vicente, J.M., \u00c1lvarez-S\u00e1nchez, J.R., de la Paz L\u00f3pez, F., Toledo-Moreo, F.J., Adeli, H. (eds.) IWINAC 2015. LNCS, vol. 9108, pp. 88\u201397. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18833-1_10"},{"key":"16_CR20","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"EG Talbi","year":"2009","unstructured":"Talbi, E.G.: Metaheuristics: From Design to Implementation. Wiley, Hoboken (2009)"},{"key":"16_CR21","doi-asserted-by":"publisher","unstructured":"Tapia, D., et al.: Embedding Q-Learning in the selection of metaheuristic operators: the enhanced binary grey wolf optimizer case. In: 2021 IEEE International Conference on Automation\/XXIV Congress of the Chilean Association of Automatic Control (ICA-ACCA), pp. 1\u20136 (2021). https:\/\/doi.org\/10.1109\/ICAACCA51523.2021.9465259","DOI":"10.1109\/ICAACCA51523.2021.9465259"},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-030-58817-5_38","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2020","author":"C V\u00e1squez","year":"2020","unstructured":"V\u00e1squez, C., et al.: Solving the 0\/1 knapsack problem using a galactic swarm optimization with data-driven binarization approaches. In: Gervasi, O., et al. (eds.) ICCSA 2020. LNCS, vol. 12254, pp. 511\u2013526. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58817-5_38"},{"key":"16_CR23","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1016\/j.future.2019.07.062","volume":"101","author":"Z Wei","year":"2019","unstructured":"Wei, Z., Hao, J.K.: Iterated two-phase local search for the Set-Union Knapsack Problem. Future Gener. Comput. Syst. 101, 1005\u20131017 (2019)","journal-title":"Future Gener. Comput. Syst."},{"key":"16_CR24","doi-asserted-by":"publisher","first-page":"113802","DOI":"10.1016\/j.eswa.2020.113802","volume":"165","author":"Z Wei","year":"2021","unstructured":"Wei, Z., Hao, J.K.: Kernel based tabu search for the Set-Union Knapsack Problem. Expert Syst. Appl. 165, 113802 (2021)","journal-title":"Expert Syst. Appl."},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"107260","DOI":"10.1016\/j.asoc.2021.107260","volume":"105","author":"Z Wei","year":"2021","unstructured":"Wei, Z., Hao, J.K.: Multistart solution-based tabu search for the Set-Union Knapsack Problem. Appl. Soft Comput. 105, 107260 (2021)","journal-title":"Appl. Soft Comput."},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Xu, J., Zhang, J.: Exploration-exploitation tradeoffs in metaheuristics: survey and analysis. In: Proceedings of the 33rd Chinese Control Conference, pp. 8633\u20138638. IEEE (2014)","DOI":"10.1109\/ChiCC.2014.6896450"},{"key":"16_CR27","doi-asserted-by":"publisher","unstructured":"Yang, X.S., Deb, S.: Cuckoo search via L\u00e9vy flights. In: 2009 World Congress on Nature Biologically Inspired Computing (NaBIC), pp. 210\u2013214. IEEE (2009). https:\/\/doi.org\/10.1109\/NABIC.2009.5393690","DOI":"10.1109\/NABIC.2009.5393690"},{"issue":"3","key":"16_CR28","doi-asserted-by":"publisher","first-page":"977","DOI":"10.12785\/amis\/080306","volume":"8","author":"XS Yang","year":"2014","unstructured":"Yang, X.S., Deb, S., Fong, S.: Metaheuristic algorithms: optimal balance of intensification and diversification. Appl. Math. Inf. Sci. 8(3), 977 (2014)","journal-title":"Appl. Math. Inf. Sci."}],"container-title":["Communications in Computer and Information Science","Informatics and Intelligent Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95630-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T18:06:51Z","timestamp":1649095611000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95630-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030956295","9783030956301"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95630-1_16","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Informatics and Intelligent Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ota","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nigeria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iciia2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iciaconference.com\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"108","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}