{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:02:20Z","timestamp":1773378140822,"version":"3.50.1"},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T00:00:00Z","timestamp":1562803200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T00:00:00Z","timestamp":1562803200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002850","name":"Fondo Nacional de Desarrollo Cient\u00edfico y Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["1171243"],"award-info":[{"award-number":["1171243"]}],"id":[{"id":"10.13039\/501100002850","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002850","name":"Fondo Nacional de Desarrollo Cient\u00edfico y Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["1160455"],"award-info":[{"award-number":["1160455"]}],"id":[{"id":"10.13039\/501100002850","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008736","name":"Fondo de Fomento al Desarrollo Cient\u00edfico y Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["ID16I10449"],"award-info":[{"award-number":["ID16I10449"]}],"id":[{"id":"10.13039\/501100008736","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s11047-019-09752-8","type":"journal-article","created":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T14:10:11Z","timestamp":1562854211000},"page":"825-841","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["A binary monkey search algorithm variation for solving the set covering problem"],"prefix":"10.1007","volume":"19","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0582-954X","authenticated-orcid":false,"given":"Rodrigo","family":"Olivares","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel","family":"Embry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diego","family":"Flores","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenceslao","family":"Palma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Castro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Paredes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9-Miguel","family":"Rubio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,11]]},"reference":[{"key":"9752_CR1","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1007\/978-3-540-75867-9_103","volume-title":"Computer aided systems theory EUROCAST 2007","author":"M Affenzeller","year":"2007","unstructured":"Affenzeller M, Wagner S, Winkler S (2007) Self-adaptive population size adjustment for genetic algorithms. Computer aided systems theory EUROCAST 2007. Springer, Berlin, pp 820\u2013828"},{"key":"9752_CR2","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.ins.2010.07.015","volume":"192","author":"B Akay","year":"2012","unstructured":"Akay B, Karaboga D (2012) A modified artificial bee colony algorithm for real-parameter optimization. Inf Sci 192:120","journal-title":"Inf Sci"},{"issue":"3","key":"9752_CR3","first-page":"203","volume":"5","author":"E Balas","year":"1997","unstructured":"Balas E (1997) A dynamic subgradient-based branch-and-bound procedure for set covering. Locat Sci 5(3):203","journal-title":"Locat Sci"},{"issue":"1","key":"9752_CR4","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1504\/ijbic.2018.090080","volume":"11","author":"MA Basset","year":"2018","unstructured":"Basset MA, Zhou Y (2018) An elite opposition-flower pollination algorithm for a 0\u20131 knapsack problem. Int J Bio Inspir Comput 11(1):46. https:\/\/doi.org\/10.1504\/ijbic.2018.090080","journal-title":"Int J Bio Inspir Comput"},{"key":"9752_CR5","unstructured":"Beasley J (2018) Or-library. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/scpinfo.html . Accessed 14 Feb 2018"},{"issue":"1","key":"9752_CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","volume":"31","author":"J Beasley","year":"1987","unstructured":"Beasley J (1987) An algorithm for set covering problem. Eur J Oper Res 31(1):85","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9752_CR7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10732-013-9235-9","volume":"20","author":"N Bilal","year":"2014","unstructured":"Bilal N, Galinier P, Guibault F (2014) An iterated-tabu-search heuristic for a variant of the partial set covering problem. J Heuristics 20(2):143","journal-title":"J Heuristics"},{"issue":"3","key":"9752_CR8","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/S0377-2217(02)00364-8","volume":"147","author":"L Brotcorne","year":"2003","unstructured":"Brotcorne L, Laporte G, Semet F (2003) Ambulance location and relocation models. Eur J Oper Res 147(3):451","journal-title":"Eur J Oper Res"},{"key":"9752_CR9","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1023\/A:1018900128545","volume":"86","author":"M Brusco","year":"1999","unstructured":"Brusco M, Jacobs L, Thompson G (1999) A morphing procedure to supplement a simulated annealing heuristic for cost and coverage correlated set covering problems. Ann Oper Res 86:611","journal-title":"Ann Oper Res"},{"key":"9752_CR10","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/0-306-48056-5_16","volume-title":"Handbook of metaheuristics","author":"E Burke","year":"2003","unstructured":"Burke E, Kendall G, Newall J, Hart E, Ross P, Schulenburg S (2003) Handbook of metaheuristics, vol 57. International series in operations research and management science. Springer, Berlin, pp 457\u2013474"},{"issue":"1","key":"9752_CR11","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1515\/math-2017-0029","volume":"15","author":"L Calvet","year":"2017","unstructured":"Calvet L, de Armas J, Masip D, Juan AA (2017) Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs. Open Math 15(1):261\u201380","journal-title":"Open Math"},{"issue":"5","key":"9752_CR12","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A Caprara","year":"1999","unstructured":"Caprara A, Fischetti M, Toth P (1999) A heuristic method for the set covering problem. Oper Res 47(5):730","journal-title":"Oper Res"},{"issue":"1\u20134","key":"9752_CR13","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A Caprara","year":"2000","unstructured":"Caprara A, Fischetti M, Toth P (2000) Algorithms for the set covering problem. Annals OR 98(1\u20134):353","journal-title":"Annals OR"},{"key":"9752_CR14","first-page":"215","volume":"81","author":"S Ceria","year":"1998","unstructured":"Ceria S, Nobili P, Sassano A (1998) A lagrangian-based heuristic for large-scale set covering problems. Math Program 81:215","journal-title":"Math Program"},{"issue":"3","key":"9752_CR15","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal V (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4(3):233","journal-title":"Math Oper Res"},{"issue":"19","key":"9752_CR16","first-page":"4667","volume":"6","author":"B Crawford","year":"2011","unstructured":"Crawford B, Soto R, Monfroy E, Paredes F, Palma W (2011) A hybrid ant algorithm for the set covering problem. Int J Phys Sci 6(19):4667","journal-title":"Int J Phys Sci"},{"key":"9752_CR17","doi-asserted-by":"crossref","unstructured":"Crawford B, Soto R, Olivares-Su\u00e1rez M, Paredes F (2014a) Advances in intelligent systems and computing. 3rd Computer science on-line conference 2014 (CSOC 2014), vol 285. Springer, Berlin, pp 65\u201373","DOI":"10.1007\/978-3-319-06740-7_6"},{"key":"9752_CR18","doi-asserted-by":"crossref","unstructured":"Crawford B, Soto R, Palma W, Johnson F, Paredes F, Olgu\u00edn E (2014b) Advances in swarm intelligence. Lecture notes in computer science, vol 8794. Springer, Berlin, pp 189\u2013196","DOI":"10.1007\/978-3-319-11857-4_22"},{"key":"9752_CR19","doi-asserted-by":"crossref","first-page":"1","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 (2017) Putting continuous metaheuristics to work in binary search spaces. Complexity 2017:1","journal-title":"Complexity"},{"key":"9752_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2015\/578541","volume":"2015","author":"B Crawford","year":"2015","unstructured":"Crawford B, Soto R, Berr\u00edos N, Johnson F, Paredes F, Castro C, Norero E (2015a) A binary cat swarm optimization algorithm for the non-unicost set covering problem. Math Prob Eng 2015:1","journal-title":"Math Prob Eng"},{"key":"9752_CR21","doi-asserted-by":"crossref","unstructured":"Crawford B, Soto R, Pe\u00f1a C, Palma W, Johnson F, Paredes F (2015b) Intelligent information and database systems. In: 7th Asian conference, ACIIDS 2015, Bali, Indonesia, March 23\u201325, 2015, Proceedings, Part II. Lecture notes in computer science, vol 9012. Springer, Berlin, pp 41\u201350","DOI":"10.1007\/978-3-319-15705-4_5"},{"key":"9752_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-017-2685-5","author":"L Cui","year":"2017","unstructured":"Cui L, Li G, Zhu Z, Wen Z, Lu N, Lu J (2017) A novel differential evolution algorithm with a self-adaptation parameter control method by differential evolution. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-017-2685-5","journal-title":"Soft Comput"},{"issue":"3","key":"9752_CR23","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1287\/opre.13.3.482","volume":"13","author":"RH Day","year":"1965","unstructured":"Day RH (1965) Letter to the editor-on optimal extracting from a multiple file data storage system: an application of integer programming. Oper Res 13(3):482","journal-title":"Oper Res"},{"issue":"1","key":"9752_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) The ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern 26(1):1","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"9752_CR25","unstructured":"Eaton JW (2018) Gnu octave. https:\/\/www.gnu.org\/software\/octave\/ (2002). Accessed 14 Feb 2018"},{"issue":"2","key":"9752_CR26","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"A Eiben","year":"1999","unstructured":"Eiben A, Hinterding R, Michalewicz Z (1999) Parameter control in evolutionary algorithms. IEEE Trans Evol Comput 3(2):124","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"9752_CR27","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo TA, Resende MG (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8(2):67","journal-title":"Oper Res Lett"},{"key":"9752_CR28","unstructured":"Fink M (2007) Proceedings of the Eleventh international conference on artificial intelligence and statistics, proceedings of machine learning research (PMLR, San Juan, Puerto Rico, 2007), vol\u00a02, pp 115\u2013122"},{"issue":"6","key":"9752_CR29","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"ML Fisher","year":"1990","unstructured":"Fisher ML, Kedia P (1990) Optimal solution of set covering\/partitioning problems using dual heuristics. Manage Sci 36(6):674","journal-title":"Manage Sci"},{"issue":"1","key":"9752_CR30","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10489-012-0393-5","volume":"39","author":"MF Han","year":"2012","unstructured":"Han MF, Liao SH, Chang JY, Lin CT (2012) Dynamic group-based differential evolution using a self-adaptive strategy for global optimization problems. Appl Intell 39(1):41. https:\/\/doi.org\/10.1007\/s10489-012-0393-5","journal-title":"Appl Intell"},{"issue":"1","key":"9752_CR31","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1137\/1024022","volume":"24","author":"J Hartmanis","year":"1982","unstructured":"Hartmanis J (1982) Computers and intractability: a guide to the theory of NP-completeness. SIAM Rev 24(1):90","journal-title":"SIAM Rev"},{"key":"9752_CR32","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor"},{"issue":"5","key":"9752_CR33","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1287\/inte.27.5.68","volume":"27","author":"E Housos","year":"1997","unstructured":"Housos E, Elmroth T (1997) Automatic optimization of subproblems in scheduling airline crews. Interfaces 27(5):68","journal-title":"Interfaces"},{"key":"9752_CR34","doi-asserted-by":"publisher","unstructured":"Iba H (2018) Evolutionary approach to machine learning and deep neural networks. Springer, Singapore, pp 27\u201375. https:\/\/doi.org\/10.1007\/978-981-13-0200-8_2","DOI":"10.1007\/978-981-13-0200-8_2"},{"key":"9752_CR35","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/j.procs.2012.09.082","volume":"12","author":"CM Ituarte-Villarreal","year":"2012","unstructured":"Ituarte-Villarreal CM, Lopez N, Espiritu JF (2012) Using the monkey algorithm for hybrid power systems optimization. Proc Comput Sci 12:344","journal-title":"Proc Comput Sci"},{"issue":"3","key":"9752_CR36","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Global Optim 39(3):459","journal-title":"J Global Optim"},{"issue":"3","key":"9752_CR37","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/j.cie.2006.08.002","volume":"51","author":"G Lan","year":"2006","unstructured":"Lan G, DePuy G (2006) On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the set covering problem. Comput Ind Eng 51(3):362","journal-title":"Comput Ind Eng"},{"key":"9752_CR38","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.eswa.2016.10.054","volume":"70","author":"J Lanza-Gutierrez","year":"2017","unstructured":"Lanza-Gutierrez J, Crawford B, Soto R, Berrios N, Gomez-Pulido J, Paredes F (2017) Analyzing the effects of binarization techniques when solving the set covering problem through swarm optimization. Expert Syst Appl 70:67","journal-title":"Expert Syst Appl"},{"issue":"3\u20134","key":"9752_CR39","first-page":"723","volume":"24","author":"X Li","year":"2012","unstructured":"Li X, Yin M (2012) Self-adaptive constrained artificial bee colony for constrained numerical optimization. Neural Comput Appl 24(3\u20134):723","journal-title":"Neural Comput Appl"},{"key":"9752_CR40","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.ins.2014.11.042","volume":"298","author":"X Li","year":"2015","unstructured":"Li X, Yin M (2015) Modified cuckoo search algorithm with self adaptive parameter method. Inf Sci 298:80","journal-title":"Inf Sci"},{"issue":"3","key":"9752_CR41","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/a:1011286929823","volume":"15","author":"KH Liang","year":"2001","unstructured":"Liang KH, Yao X, Newton CS (2001) Adapting self-adaptive parameters in evolutionary algorithms. Appl Intell 15(3):171. https:\/\/doi.org\/10.1023\/a:1011286929823","journal-title":"Appl Intell"},{"issue":"318","key":"9752_CR42","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1080\/01621459.1967.10482916","volume":"62","author":"H Lilliefors","year":"1967","unstructured":"Lilliefors H (1967) On the Kolmogorov-Smirnov test for normality with mean and variance unknown. J Am Stat Assoc 62(318):399","journal-title":"J Am Stat Assoc"},{"key":"9752_CR43","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.asoc.2015.04.020","volume":"33","author":"S Mahmoudi","year":"2015","unstructured":"Mahmoudi S, Lotfi S (2015) Modified cuckoo optimization algorithm (MCOA) to solve graph coloring problem. Appl Soft Comput 33:48","journal-title":"Appl Soft Comput"},{"issue":"1","key":"9752_CR44","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1214\/aoms\/1177730491","volume":"18","author":"H Mann","year":"1947","unstructured":"Mann H, Donald W (1947) On a test of whether one of two random variables is stochastically larger than the other. Ann Math Stat 18(1):50","journal-title":"Ann Math Stat"},{"issue":"1145\/3230905","key":"9752_CR45","first-page":"3230906","volume":"10","author":"S Memeti","year":"2018","unstructured":"Memeti S, Pllana S, Binotto A, Ko\u0142odziej J, Brandic I (2018) Proceedings of the international conference on learning and optimization algorithms: theory and applications - LOPAL 18. ACM Press. doi 10(1145\/3230905):3230906","journal-title":"ACM Press. doi"},{"key":"9752_CR46","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/j.ijepes.2014.10.004","volume":"65","author":"TT Nguyen","year":"2015","unstructured":"Nguyen TT, Vo DN (2015) Modified cuckoo search algorithm for short-term hydrothermal scheduling. Int J Electr Power Energy Syst 65:271","journal-title":"Int J Electr Power Energy Syst"},{"key":"9752_CR47","unstructured":"Olamaei J, Moradi M, Kaboodi T (2013) 18th Electric power distribution conference, pp 1\u20136"},{"key":"9752_CR48","doi-asserted-by":"publisher","unstructured":"Qin A, Suganthan P (2005) Self-adaptive differential evolution algorithm for numerical optimization. In: 2005 IEEE congress on evolutionary computation (IEEE, 2005), pp 1785\u20131791. https:\/\/doi.org\/10.1109\/cec.2005.1554904","DOI":"10.1109\/cec.2005.1554904"},{"issue":"1","key":"9752_CR49","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1111\/j.1538-4632.1976.tb00529.x","volume":"8","author":"C ReVelle","year":"2010","unstructured":"ReVelle C, Toregas C, Falkson L (2010) Applications of the location set covering problem. Geogr Anal 8(1):65","journal-title":"Geogr Anal"},{"key":"9752_CR50","first-page":"191","volume-title":"The theory of parameters and syntactic development","author":"T Roeper","year":"1987","unstructured":"Roeper T, Williams E (1987) Parameter setting. In: Hyams N (ed) The theory of parameters and syntactic development. Springer, Netherlands, pp 191\u2013215"},{"issue":"4","key":"9752_CR51","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1007\/s10489-011-0297-9","volume":"36","author":"C Salto","year":"2011","unstructured":"Salto C, Alba E (2011) Designing heterogeneous distributed GAs by efficiently self-adapting the migration period. Appl Intell 36(4):800. https:\/\/doi.org\/10.1007\/s10489-011-0297-9","journal-title":"Appl Intell"},{"issue":"3","key":"9752_CR52","first-page":"18","volume":"6","author":"ME Salveson","year":"1995","unstructured":"Salveson ME (1995) The assembly line balancing problem. J Ind Eng 6(3):18","journal-title":"J Ind Eng"},{"issue":"4","key":"9752_CR53","first-page":"621","volume":"20","author":"R Soto","year":"2013","unstructured":"Soto R, Crawford B, Misra S, Palma W, Monfroy E, Castro C, Paredes F (2013) Choice functions for autonomous search in constraint programming: GA vs PSO. Tech Gaz 20(4):621","journal-title":"Tech Gaz"},{"key":"9752_CR54","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2015\/580785","volume":"2015","author":"R Soto","year":"2015","unstructured":"Soto R, Crawford B, Palma W, Monfroy E, Olivares C, Castro Rodrigoand, Paredes F (2015a) Top- k based adaptive enumeration in constraint programming. Math Prob Eng 2015:1","journal-title":"Math Prob Eng"},{"key":"9752_CR55","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.ins.2015.01.035","volume":"308","author":"R Soto","year":"2015","unstructured":"Soto R, Crawford B, Palma W, Galleguillos K, Castro C, Monfroy E, Johnson F, Paredes F (2015b) Boosting autonomous search for CSPs via skylines. Inf Sci 308:38","journal-title":"Inf Sci"},{"key":"9752_CR56","doi-asserted-by":"crossref","unstructured":"Soto R, Crawford B, Mu\u00f1oz A, Johnson F, Paredes F (2015c) Advances in intelligent systems and computing. Artificial Intelligence Perspectives and Applications, vol 347. Springer, Berlin, pp 89\u201397","DOI":"10.1007\/978-3-319-18476-0_10"},{"issue":"2","key":"9752_CR57","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s11047-016-9609-7","volume":"16","author":"R Soto","year":"2017","unstructured":"Soto R, Crawford B, Olivares R, Barraza J, Figueroa I, Johnson F, Paredes F, Olgu\u00edn E (2017) Solving the non-unicost set covering problem by using cuckoo search and black hole optimization. Nat Comput 16(2):213","journal-title":"Nat Comput"},{"issue":"3","key":"9752_CR58","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1109\/9.119632","volume":"37","author":"J Spall","year":"1992","unstructured":"Spall J (1992) Multivariate stochastic approximation using a simultaneous perturbation gradient approximation. IEEE Trans Autom Control 37(3):332","journal-title":"IEEE Trans Autom Control"},{"key":"9752_CR59","first-page":"191","volume-title":"What is autonomous search?","author":"T Stutzle","year":"2012","unstructured":"Stutzle T, Lopez-Ibanez M, Pellegrini P, Maur M, Montes de Oca M, Birattari M, Dorigo M (2012) What is autonomous search?. Parameter adaptation in ant colony optimization. Springer, Berlin, pp 191\u2013215"},{"issue":"2","key":"9752_CR60","doi-asserted-by":"crossref","first-page":"377","DOI":"10.15837\/ijccc.2012.2.1417","volume":"7","author":"C Valenzuela","year":"2014","unstructured":"Valenzuela C, Crawford B, Soto R, Monfroy E, Paredes F (2014) A 2-level metaheuristic for the set covering problem. Int J Comput Commun Control 7(2):377","journal-title":"Int J Comput Commun Control"},{"issue":"2","key":"9752_CR61","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0167-6377(84)90047-6","volume":"3","author":"FJ Vasko","year":"1984","unstructured":"Vasko FJ, Wilson GR (1984) Using a facility location algorithm to solve large set covering problems. Oper Res Lett 3(2):85","journal-title":"Oper Res Lett"},{"issue":"3","key":"9752_CR62","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/opre.35.3.346","volume":"35","author":"FJ Vasko","year":"1987","unstructured":"Vasko FJ, Wolf FE, Stott KL (1987) Optimal selection of ingot sizes via set covering. Oper Res 35(3):346","journal-title":"Oper Res"},{"key":"9752_CR63","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.asoc.2017.04.057","volume":"58","author":"C Xin","year":"2017","unstructured":"Xin C, Zhou Y, Zhonghua T, Qifang L (2017) A hybrid algorithm combining glowworm swarm optimization and complete 2-opt algorithm for spherical travelling salesman problems. Appl Soft Comput 58:104. https:\/\/doi.org\/10.1016\/j.asoc.2017.04.057","journal-title":"Appl Soft Comput"},{"key":"9752_CR64","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-3-642-12538-6_6","volume-title":"Nature Inspired Cooperative Strategies for optimization (NICSO)","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010) Nature Inspired Cooperative Strategies for optimization (NICSO), vol 284. Studies in computational intelligence. Springer, Berlin, pp 65\u201374"},{"issue":"1","key":"9752_CR65","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1504\/ijsi.2013.055801","volume":"1","author":"XS Yang","year":"2013","unstructured":"Yang XS, He X (2013) Firefly algorithm: recent advances and applications. Int J Swarm Intell 1(1):36. https:\/\/doi.org\/10.1504\/ijsi.2013.055801","journal-title":"Int J Swarm Intell"},{"issue":"2","key":"9752_CR66","doi-asserted-by":"crossref","first-page":"575","DOI":"10.3934\/jimo.2015.11.575","volume":"11","author":"B Yelbay","year":"2014","unstructured":"Yelbay B, Birbil \u015e\u0130, B\u00fclb\u00fcl K (2014) The set covering problem revisited: an empirical study of the value of dual information. JIMO 11(2):575","journal-title":"JIMO"},{"issue":"4","key":"9752_CR67","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1007\/s10489-014-0620-3","volume":"42","author":"W Yi","year":"2014","unstructured":"Yi W, Gao L, Li X, Zhou Y (2014) A new differential evolution algorithm with a hybrid mutation operator and self-adapting control parameters for global optimization problems. Appl Intell 42(4):642. https:\/\/doi.org\/10.1007\/s10489-014-0620-3","journal-title":"Appl Intell"},{"key":"9752_CR68","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.advengsoft.2016.05.015","volume":"99","author":"S Zhang","year":"2016","unstructured":"Zhang S, Zhou Y, Li Z, Pan W (2016) Grey wolf optimizer for unmanned combat aerial vehicle path planning. Adv Eng Softw 99:121. https:\/\/doi.org\/10.1016\/j.advengsoft.2016.05.015","journal-title":"Adv Eng Softw"},{"issue":"3","key":"9752_CR69","first-page":"165","volume":"2","author":"R Zhao","year":"2008","unstructured":"Zhao R, Tang W (2008) Monkey algorithm for global numerical optimization. J Uncertain Syst 2(3):165","journal-title":"J Uncertain Syst"},{"issue":"1","key":"9752_CR70","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/ijbic.2016.10004304","volume":"1","author":"Y Zhou","year":"2016","unstructured":"Zhou Y (2016) Hybrid symbiotic organisms search algorithm for solving 0\u20131 knapsack problem. Int J Bio Inspir Comput 1(1):1. https:\/\/doi.org\/10.1504\/ijbic.2016.10004304","journal-title":"Int J Bio Inspir Comput"},{"key":"9752_CR71","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.neucom.2013.05.063","volume":"137","author":"Y Zhou","year":"2014","unstructured":"Zhou Y, Chen H, Zhou G (2014) Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem. Neurocomputing 137:285. https:\/\/doi.org\/10.1016\/j.neucom.2013.05.063","journal-title":"Neurocomputing"},{"key":"9752_CR72","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1016\/j.neucom.2014.01.078","volume":"151","author":"Y Zhou","year":"2015","unstructured":"Zhou Y, Luo Q, Chen H, He A, Wu J (2015a) A discrete invasive weed optimization algorithm for solving traveling salesman problem. Neurocomputing 151:1227. https:\/\/doi.org\/10.1016\/j.neucom.2014.01.078","journal-title":"Neurocomputing"},{"issue":"2","key":"9752_CR73","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s11063-015-9465-y","volume":"44","author":"Y Zhou","year":"2015","unstructured":"Zhou Y, Li L, Ma M (2015b) A complex-valued encoding bat algorithm for solving 0\u20131 knapsack problem. Neural Process Lett 44(2):407. https:\/\/doi.org\/10.1007\/s11063-015-9465-y","journal-title":"Neural Process Lett"},{"issue":"3","key":"9752_CR74","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/s10489-016-0855-2","volume":"46","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Bao Z, Luo Q, Zhang S (2016a) A complex-valued encoding wind driven optimization for the 0\u20131 knapsack problem. Appl Intell 46(3):684. https:\/\/doi.org\/10.1007\/s10489-016-0855-2","journal-title":"Appl Intell"},{"key":"9752_CR75","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1016\/j.asoc.2015.10.043","volume":"38","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Chen X, Zhou G (2016b) An improved monkey algorithm for a 0\u20131 knapsack problem. Appl Soft Comput 38:817","journal-title":"Appl Soft Comput"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-019-09752-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-019-09752-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-019-09752-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T05:25:01Z","timestamp":1695014701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-019-09752-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,11]]},"references-count":75,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["9752"],"URL":"https:\/\/doi.org\/10.1007\/s11047-019-09752-8","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,11]]},"assertion":[{"value":"11 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}