{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T09:34:37Z","timestamp":1774690477269,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319067391","type":"print"},{"value":"9783319067407","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","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":[[2014]]},"DOI":"10.1007\/978-3-319-06740-7_6","type":"book-chapter","created":{"date-parts":[[2014,5,5]],"date-time":"2014-05-05T21:11:06Z","timestamp":1399324266000},"page":"65-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["A Binary Firefly Algorithm for the Set Covering Problem"],"prefix":"10.1007","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"}]},{"given":"Miguel","family":"Olivares-Su\u00e1rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Paredes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,6]]},"reference":[{"issue":"5","key":"6_CR1","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1287\/inte.27.5.68","volume":"27","author":"E Housos","year":"1997","unstructured":"Housos, E., Elmoth, T.: Automatic optimization of subproblems in scheduling airlines crews. Interfaces 27(5), 68\u201377 (1997)","journal-title":"Interfaces"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0167-6377(84)90047-6","volume":"3","author":"FJ Vasko","year":"1984","unstructured":"Vasko, F.J., Wilson, G.R.: Using a facility location algorithm to solve large set covering problems. Oper. Res. Lett. 3(2), 85\u201390 (1984)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/opre.35.3.346","volume":"35","author":"FJ Vasko","year":"1987","unstructured":"Vasko, F.J., Wolf, F.E.: Optimal selection of ingot sizes via set covering. Oper. Res. 35(3), 346\u2013353 (1987)","journal-title":"Oper. Res."},{"key":"6_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co, New York (1990)"},{"issue":"6","key":"6_CR5","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1287\/opre.44.6.875","volume":"44","author":"E Balas","year":"1996","unstructured":"Balas, E., Carrera, M.C.: A dynamic subgradient-based branch-and-bound procedure for set covering. Oper. Res. 44(6), 875\u2013890 (1996)","journal-title":"Oper. Res."},{"issue":"6","key":"6_CR6","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"ML Fisher","year":"1990","unstructured":"Fisher, M.L., Kedia, P.: Optimal solution of set covering\/partitioning problems using dual heuristics. Manage. Sci. 36(6), 674\u2013688 (1990)","journal-title":"Manage. Sci."},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.cie.2006.08.002","volume":"51","author":"G Lan","year":"2006","unstructured":"Lan, G., DePuy, G.W.: 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 (2006)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01581106","volume":"81","author":"S Ceria","year":"1998","unstructured":"Ceria, S., Nobili, P., Sassano, A.: A Lagrangian-based heuristic for large-scale set covering problems. Math. Program. 81(2), 215\u2013228 (1998)","journal-title":"Math. Program."},{"issue":"5","key":"6_CR10","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A Caprara","year":"1999","unstructured":"Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Oper. Res. 47(5), 730\u2013743 (1999)","journal-title":"Oper. Res."},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"JE Beasley","year":"1996","unstructured":"Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 94(2), 392\u2013404 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1023\/A:1018900128545","volume":"86","author":"MJ Brusco","year":"1999","unstructured":"Brusco, M.J., Jacobs, L.W., Thompson, G.M.: A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems. Ann. Oper. Res. 86, 611\u2013627 (1999)","journal-title":"Ann. Oper. Res."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Caserta, M.: Tabu search-based metaheuristic algorithm for large-scale set covering problems. In: Doerner, K., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R., Reimann, M. (eds.) Metaheuristics. Vol. 39 of Operations Research\/Computer Science Interfaces Series, pp. 43\u201363. Springer, US (2007)","DOI":"10.1007\/978-0-387-71921-4_3"},{"key":"6_CR14","unstructured":"Crawford, B., Lagos, C., Castro, C., Paredes, F.: A evolutionary approach to solve set covering. In: Cardoso, J., Cordeiro, J., Filipe, J. (eds.) In: Proceedings of the 9th International Conference on Enterprise Information Systems (ICEIS '07), Vol. AIDSS, pp. 356-363. Funchal, Portugal. 12-16 June 2007"},{"issue":"4","key":"6_CR15","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.cie.2010.02.011","volume":"58","author":"ZG Ren","year":"2010","unstructured":"Ren, Z.G., Feng, Z.R., Ke, L.J., Zhang, Z.J.: New ideas for applying ant colony optimization to the set covering problem. Comput. Ind. Eng. 58(4), 774\u2013784 (2010)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.ejor.2010.01.035","volume":"205","author":"Z Naji-Azimi","year":"2010","unstructured":"Naji-Azimi, Z., Toth, P., Galli, L.: An electromagnetism metaheuristic for the unicost set covering problem. Eur. J. Oper. Res. 205(2), 290\u2013300 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR17","unstructured":"Balachandar, S.R., Kannan, K.: A meta-heuristic algorithm for set covering problem based on gravity. J. Comput. Math. Sci. 4, 223\u2013228 (2010)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Monfroy, E.: Cultural algorithms for the set covering problem. In: Tan, Y., Shi, Y., Mo, H. (eds.) ICSI (2). Vol. 7929 of Lecture Notes in Computer Science, pp. 27\u201334. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-38715-9_4"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A Caprara","year":"2000","unstructured":"Caprara, A., Toth, P., Fischetti, M.: Algorithms for the set covering problem. Ann. Oper. Res. 98, 353\u2013371 (2000)","journal-title":"Ann. Oper. Res."},{"key":"6_CR20","volume-title":"Nature-Inspired Metaheuristic Algorithms","author":"XS Yang","year":"2008","unstructured":"Yang, X.S.: Nature-Inspired Metaheuristic Algorithms. Luniver Press, UK (2008)"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Yang, X.S.: Firefly algorithms for multimodal optimisation, In: Proceedings of the 5th International Conference on Stochastic Algorithms: Foundations and Applications. SAGA\u201909, pp. 169\u2013178. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-04944-6_14"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.swevo.2013.06.001","volume":"13","author":"I Fister","year":"2013","unstructured":"Fister, I., Fister Jr, I., Yang, X.S., Brest, J.: A comprehensive review of firefly algorithms. Swarm Evol. Comput. 13, 34\u201346 (2013)","journal-title":"Swarm Evol. Comput."},{"key":"6_CR23","unstructured":"Yang, X.S., He, X.: Firefly Algorithm: Recent Advances and Applications. The Computing Research Repository, abs\/1308.3898 (2013)"},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ins.2013.06.022","volume":"249","author":"K Chandrasekaran","year":"2013","unstructured":"Chandrasekaran, K., Sishaj, P.S., Padhy, N.P.: Binary real coded firefly algorithm for solving unit commitment problem. Inf. Sci. 249, 67\u201384 (2013)","journal-title":"Inf. Sci."},{"issue":"1","key":"6_CR25","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2","volume":"37","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: A Lagrangian heuristic for set covering problems. Naval Res. Logistics 37(1), 151\u2013164 (1990)","journal-title":"Naval Res. Logistics"},{"issue":"5","key":"6_CR26","doi-asserted-by":"publisher","first-page":"1690","DOI":"10.1016\/j.eswa.2012.09.013","volume":"40","author":"B Crawford","year":"2013","unstructured":"Crawford, B., Soto, R., Monfroy, E., Palma, W., Castro, C., Paredes, P.: Parameter tuning of a choice-function based hyperheuristic using particle swarm optimization. Expert Syst. Appl. 40(5), 1690\u20131695 (2013)","journal-title":"Expert Syst. Appl."},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Soto, R., Crawford, B., Monfroy, E., Bustos, V.: Using autonomous search for generating good enumeration strategy blends in constraint programming. In: Proceedings of the 12th International Conference on Computational Science and Its Applications (ICCSA). Vol. 7335 of LNCS, pp. 607\u2013617. Springer (2012)","DOI":"10.1007\/978-3-642-31137-6_46"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto R., Montecinos M., Castro C., Monfroy, E.: A framework for autonomous search in the eclipse solver. In: Proceedings of the 24th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems (IEA\/AIE). Vol. 6703 of LNCS, pp. 79\u201384. Springer (2011)","DOI":"10.1007\/978-3-642-21822-4_9"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto R., Castro C., Monfroy, E.: Extensible CP-based autonomous search. In: Proceedings of HCI International. Vol. 173 of CCIS, pp. 561\u2013565. Springer (2011)","DOI":"10.1007\/978-3-642-22098-2_112"}],"container-title":["Advances in Intelligent Systems and Computing","Modern Trends and Techniques in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06740-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T00:28:29Z","timestamp":1675124909000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-06740-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319067391","9783319067407"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06740-7_6","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"6 May 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}