{"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":1773378140860,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,1,11]],"date-time":"2017-01-11T00:00:00Z","timestamp":1484092800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s11047-016-9609-7","type":"journal-article","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T21:50:19Z","timestamp":1484085019000},"page":"213-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Solving the non-unicost set covering problem by using cuckoo search and black hole optimization"],"prefix":"10.1007","volume":"16","author":[{"given":"Ricardo","family":"Soto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo","family":"Olivares","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge","family":"Barraza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignacio","family":"Figueroa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franklin","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Paredes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Olgu\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,11]]},"reference":[{"issue":"1","key":"9609_CR1","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/BF01588309","volume":"18","author":"D Avis","year":"1980","unstructured":"Avis D (1980) A note on some computationally difficult set covering problems. Math Program 18(1):138\u2013145","journal-title":"Math Program"},{"issue":"2","key":"9609_CR2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1080\/05695557908974446","volume":"11","author":"E Baker","year":"1979","unstructured":"Baker E, Bodin L, Finnegan W, Ponder R (1979) Efficient heuristic solutions to an airline crew scheduling problem. AIIE Trans 11(2):79\u201385","journal-title":"AIIE Trans"},{"issue":"3","key":"9609_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\u2013203","journal-title":"Locat Sci"},{"issue":"3","key":"9609_CR4","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1287\/opre.29.3.501","volume":"29","author":"J Bartholdi","year":"1981","unstructured":"Bartholdi J (1981) A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering. Oper Res 29(3):501\u2013510","journal-title":"Oper Res"},{"issue":"1","key":"9609_CR5","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\u201393","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9609_CR6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/A:1022452626305","volume":"25","author":"\u015e\u0130 Birbil","year":"2003","unstructured":"Birbil \u015e\u0130, Fang S-C (2003) An electromagnetism-like mechanism for global optimization. J Global Optim 25(3):263\u2013282","journal-title":"J Global Optim"},{"issue":"1","key":"9609_CR7","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1145\/321556.321572","volume":"17","author":"M Breuer","year":"1970","unstructured":"Breuer M (1970) Simplification of the covering problem with application to boolean expressions. J ACM 17(1):166\u2013181","journal-title":"J ACM"},{"key":"9609_CR8","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\u2013627","journal-title":"Ann Oper Res"},{"issue":"5","key":"9609_CR9","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\u2013743","journal-title":"Oper Res"},{"issue":"1\u20134","key":"9609_CR10","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. Ann OR 98(1\u20134):353\u2013371","journal-title":"Ann OR"},{"key":"9609_CR11","doi-asserted-by":"crossref","unstructured":"Caserta M (2007) Tabu search-based metaheuristic algorithm for large-scale set covering problems, In: Metaheuristics: progress in complex systems optimization. Springer, Boston, pp. 43\u201363. ISBN 978-0-387-71921-4","DOI":"10.1007\/978-0-387-71921-4_3"},{"key":"9609_CR12","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 Prog 81:215\u2013228","journal-title":"Math Prog"},{"issue":"3","key":"9609_CR13","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\u2013235","journal-title":"Math Oper Res"},{"issue":"19","key":"9609_CR15","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\u20134673","journal-title":"Int J Phys Sci"},{"key":"9609_CR16","doi-asserted-by":"crossref","unstructured":"Crawford B, Soto R, Monfroy E (2013) Cultural algorithms for the set covering problem, In: Advances in swarm intelligence: 4th international conference, ICSI 2013, Harbin, China, June 12\u201315, 2013, Proceedings, Part II. Springer, Berlin, Heidelberg, pp 27\u201334","DOI":"10.1007\/978-3-642-38715-9_4"},{"key":"9609_CR17","doi-asserted-by":"crossref","unstructured":"Crawford B, Soto R, Olivares-Su\u00e1rez M, Paredes F (2014) A binary firefly algorithm for the set covering problem. In: 3rd computer science on-line conference 2014 (CSOC 2014). Advances in intelligent systems and computing, vol. 285. Springer, Cham, pp 65\u201373","DOI":"10.1109\/CISTI.2014.6877090"},{"key":"9609_CR18","doi-asserted-by":"crossref","unstructured":"Crawford B, Soto R, Pe\u00f1a C, Riquelme-Leiva M, Torres-Rojas C, Johnson F, Paredes F (2015a) Binarization methods for shuffled frog leaping algorithms that solve set covering problems, In: Proceedings of the 4th computer science on-line conference 2015 (CSOC2015), vol 3: software engineering in intelligent systems. Advances in intelligent systems and computing, vol. 349. Springer, Cham, pp 317\u2013326","DOI":"10.1007\/978-3-319-18473-9_31"},{"key":"9609_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2015\/578541","volume":"2015","author":"B Crawford","year":"2015","unstructured":"Crawford B, Soto R, Berros N, Johnson F, Paredes F, Castro C, Norero E (2015b) A binary cat swarm optimization algorithm for the non-unicost set covering problem. Math Probl Eng 2015:1\u20138","journal-title":"Math Probl Eng"},{"key":"9609_CR19","doi-asserted-by":"crossref","unstructured":"Crawford B, Soto R, Pe\u00f1a C, Palma W, Johnson F, Paredes F (2015c) Solving the set covering problem with a shuffled frog leaping algorithm. In: 7th Asian conference, ACIIDS 2015, Bali, Indonesia, March 23-25, 2015, Proceedings, Part II. Lecture Notes in Computer Science, vol. 9012. Springer, Cham, pp 41\u201350","DOI":"10.1007\/978-3-319-15705-4_5"},{"key":"9609_CR20","doi-asserted-by":"crossref","unstructured":"Crawford B, Soto R, Berros N, Johnson F, Paredes F (2015d) Solving the set covering problem with binary cat swarm optimization. In: Advances in swarm and computational intelligence. Lecture notes in computer science, vol. 9140. Springer, Cham, pp 41\u201348","DOI":"10.1007\/978-3-319-20466-6_4"},{"key":"9609_CR21","doi-asserted-by":"crossref","unstructured":"Cuesta R, Crawford B, Soto R, Paredes F (2014) An artificial bee colony algorithm for the set covering problem, In: 3rd Computer science on-line conference 2014 (CSOC 2014). Advances in intelligent systems and computing, vol. 285. Springer, Cham, pp 53\u201363","DOI":"10.1007\/978-3-319-06740-7_5"},{"issue":"6","key":"9609_CR22","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"M Fisher","year":"1990","unstructured":"Fisher M, Kedia P (1990) Optimal solution of set covering\/partitioning problems using dual heuristics. Manage Sci 36(6):674\u2013688","journal-title":"Manage Sci"},{"key":"9609_CR23","doi-asserted-by":"crossref","unstructured":"Fouladgar N, Lotfi S (2015) A novel swarm intelligence algorithm based on cuckoo search algorithm (NSICS). In: 11th International conference, ICIC 2015, Fuzhou, China, August 20\u201323, 2015, Proceedings, part I. Lecture notes in computer Science, vol. 9225. Springer, Cham, pp 587\u2013596","DOI":"10.1007\/978-3-319-22180-9_58"},{"key":"9609_CR24","doi-asserted-by":"crossref","unstructured":"Gass S, Fu M (2013) Set-covering problem, In: Encyclopedia of operations research and management science. Springer, Cham, pp 1393\u20131393","DOI":"10.1007\/978-1-4419-1153-7_200755"},{"key":"9609_CR25","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.ins.2012.08.023","volume":"222","author":"A Hatamlou","year":"2013","unstructured":"Hatamlou A (2013) Black hole: a new heuristic optimization approach for data clustering. Inf Sci 222:175\u2013184","journal-title":"Inf Sci"},{"key":"9609_CR26","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization, Technical Report 06, Computer Engineering Department, Erciyes University, Kayseri, Turkey"},{"key":"9609_CR27","doi-asserted-by":"crossref","unstructured":"Kumar S, Datta D, Singh S (2015) Black hole algorithm and its applications, In: Computational intelligence applications in modeling and control. Studies in computational intelligence, vol. 575. Springer, Cham, pp 147\u2013170","DOI":"10.1007\/978-3-319-11017-2_7"},{"issue":"3","key":"9609_CR28","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\u2013374","journal-title":"Comput Ind Eng"},{"issue":"318","key":"9609_CR29","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\u2013smirnov test for normality with mean and variance unknown. J Am Stat Assoc 62(318):399\u2013402","journal-title":"J Am Stat Assoc"},{"issue":"1","key":"9609_CR30","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1214\/aoms\/1177730491","volume":"18","author":"H Mann","year":"1947","unstructured":"Mann H, Whitney D (1947) On a test of whether one of two random variables is stochastically larger than the other. Ann Math Stat 18(1):50\u201360","journal-title":"Ann Math Stat"},{"key":"9609_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2012.09.002","volume":"9","author":"S Mirjalili","year":"2013","unstructured":"Mirjalili S, Lewis A (2013) S-shaped versus v-shaped transfer functions for binary particle swarm optimization. Swarm Evol Comput 9:1\u201314","journal-title":"Swarm Evol Comput"},{"key":"9609_CR32","doi-asserted-by":"crossref","unstructured":"Munagala K, Babu S, Motwani R, Widom J (2004) The pipelined set cover problem. In: Database theory-ICDT 2005. Springer, Berlin, Heidelberg, pp 83\u201398","DOI":"10.1007\/978-3-540-30570-5_6"},{"issue":"6","key":"9609_CR33","first-page":"36","volume":"79","author":"M Nemati","year":"2013","unstructured":"Nemati M, Momeni H, Bazrkar N (2013) Article: binary black holes algorithm. Int J Comput Appl 79(6):36\u201342","journal-title":"Int J Comput Appl"},{"key":"9609_CR34","doi-asserted-by":"crossref","unstructured":"Pereira L, Rodrigues D, Almeida T, Ramos C, Souza A, Yang X-S, Papa JaP (2014) A binary cuckoo search and its application for feature selection. In: Cuckoo search and firefly algorithm. Studies in computational intelligence, vol 516. Springer, Cham, pp 141\u2013154","DOI":"10.1007\/978-3-319-02141-6_7"},{"issue":"1","key":"9609_CR35","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1287\/trsc.7.1.34","volume":"7","author":"J Rubin","year":"1973","unstructured":"Rubin J (1973) A technique for the solution of massive set covering problems, with application to airline crew scheduling. Transp Sci 7(1):34\u201348","journal-title":"Transp Sci"},{"issue":"5","key":"9609_CR36","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0167-6377(93)90050-Q","volume":"13","author":"R Rushmeier","year":"1993","unstructured":"Rushmeier R, Nemhauser G (1993) Experiments with parallel branch-and-bound algorithms for the set covering problem. Oper Res Lett 13(5):277\u2013285","journal-title":"Oper Res Lett"},{"key":"9609_CR37","first-page":"18","volume":"6","author":"M Salveson","year":"1955","unstructured":"Salveson M (1955) The assembly line balancing problem. J Ind Eng 6:18\u201325","journal-title":"J Ind Eng"},{"issue":"4","key":"9609_CR38","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\u2013629","journal-title":"Tech Gaz"},{"key":"9609_CR41","doi-asserted-by":"crossref","unstructured":"Soto R, Crawford B, Olivares R, Barraza J, Johnson F, Paredes F (2015a) A binary cuckoo search algorithm for solving the set covering problem. In: Bioinspired computation in artificial systems-international work-conference on the interplay between natural and artificial computation, IWINAC 2015, Elche, Spain, June 1\u20135, 2015, Proceedings, Part II, pp 88\u201397","DOI":"10.1007\/978-3-319-18833-1_10"},{"key":"9609_CR39","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\u201348","journal-title":"Inf Sci"},{"key":"9609_CR40","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 R, Castro C, Paredes F (2015) Top- $$k$$ k based adaptive enumeration in constraint programming. Math Probl Eng 2015:1\u201312","journal-title":"Math Probl Eng"},{"key":"9609_CR42","doi-asserted-by":"crossref","unstructured":"Soto R, Crawford B, Mu\u00f1oz A, Johnson F, Paredes F (2015c) Pre-processing, repairing and transfer functions can help binary electromagnetism-like algorithms. In: Artificial intelligence perspectives and applications. Advances in intelligent systems and computing, vol. 347. Springer, Cham, pp 89\u201397","DOI":"10.1007\/978-3-319-18476-0_10"},{"issue":"6","key":"9609_CR43","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1287\/opre.19.6.1363","volume":"19","author":"C Toregas","year":"1971","unstructured":"Toregas C, Swain R, ReVelle C, Bergman L (1971) The location of emergency service facilities. Oper Res 19(6):1363\u20131373","journal-title":"Oper Res"},{"issue":"2","key":"9609_CR44","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":"9609_CR45","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1287\/opre.22.2.275","volume":"22","author":"W Walker","year":"1974","unstructured":"Walker W (1974) Using the set-covering problem to assign fire companies to fire houses. Oper Res 22(2):275\u2013277","journal-title":"Oper Res"},{"issue":"1","key":"9609_CR46","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s00521-013-1367-1","volume":"24","author":"X-S Yang","year":"2014","unstructured":"Yang X-S, Deb S (2014) Cuckoo search: recent advances and applications. Neural Comput Appl 24(1):169\u2013174","journal-title":"Neural Comput Appl"},{"key":"9609_CR47","unstructured":"Yang X-S, Deb S (2009) Search Cuckoo, via Levy flights. In: Nature biologically inspired computing, NaBIC 2009. World Congress on 2009, pp 210\u2013214"},{"issue":"2","key":"9609_CR48","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\u2013594","journal-title":"JIMO"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-016-9609-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-016-9609-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-016-9609-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T07:03:20Z","timestamp":1568703800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-016-9609-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,11]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["9609"],"URL":"https:\/\/doi.org\/10.1007\/s11047-016-9609-7","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,11]]}}}