{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:13:09Z","timestamp":1746245589955,"version":"3.40.4"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319078564"},{"type":"electronic","value":"9783319078571"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07857-1_89","type":"book-chapter","created":{"date-parts":[[2014,5,19]],"date-time":"2014-05-19T05:35:47Z","timestamp":1400477747000},"page":"509-514","source":"Crossref","is-referenced-by-count":5,"title":["Using the Firefly Optimization Method to Solve the Weighted 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","reference":[{"key":"89_CR1","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1057\/palgrave.jors.2601317","volume":"53","author":"U. Aickelin","year":"2002","unstructured":"Aickelin, U.: An indirect genetic algorithm for set covering problems. Journal of the Operational Research Society\u00a053, 1118\u20131126 (2002)","journal-title":"Journal of the Operational Research Society"},{"issue":"6","key":"89_CR2","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. Operations Research\u00a044(6), 875\u2013890 (1996)","journal-title":"Operations Research"},{"issue":"2","key":"89_CR3","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"J. Beasley","year":"1996","unstructured":"Beasley, J., Chu, P.: A genetic algorithm for the set covering problem. European Journal of Operational Research\u00a094(2), 392\u2013404 (1996)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"89_CR4","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":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E.: A lagrangian heuristic for set-covering problems. Naval Research Logistics (NRL)\u00a037(1), 151\u2013164 (1990)","journal-title":"Naval Research Logistics (NRL)"},{"issue":"2","key":"89_CR5","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0377-2217(92)90215-U","volume":"58","author":"J.E. Beasley","year":"1992","unstructured":"Beasley, J.E., Jornsten, K.: Enhancing an algorithm for set covering problems. European Journal of Operational Research\u00a058(2), 293\u2013300 (1992)","journal-title":"European Journal of Operational Research"},{"key":"89_CR6","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1023\/A:1018900128545","volume":"86","author":"M.J. 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. Annals of Operations Research\u00a086, 611\u2013627 (1999)","journal-title":"Annals of Operations Research"},{"key":"89_CR7","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. Annals of Operations Research\u00a098, 353\u2013371 (2000)","journal-title":"Annals of Operations Research"},{"key":"89_CR8","unstructured":"Caserta, M.: abu search-based metaheuristic algorithm for large-scale set covering problems. In: Doerner, K.F., et al. (eds.) Metaheuristics: Progress in complex systems optimization. Springer"},{"key":"89_CR9","doi-asserted-by":"crossref","unstructured":"Crawford, B., Castro, C., Monfroy, E.: A New ACO Transition Rule for Set Partitioning and Covering Problems. In: SoCPaR, pp. 426\u2013429 (2009)","DOI":"10.1109\/SoCPaR.2009.89"},{"key":"89_CR10","doi-asserted-by":"crossref","unstructured":"Crawford, B., Lagos, C., Castro, C., Parede, F.: A Evolutionary Approach to Solve Set Covering. In: ICEIS, vol.\u00a02, pp. 356\u2013363 (2007)","DOI":"10.5220\/0002406703560360"},{"key":"89_CR11","series-title":"CCIS","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-642-22098-2_112","volume-title":"HCI International 2011 \u2013 Posters\u2019 Extended Abstracts","author":"B. Crawford","year":"2011","unstructured":"Crawford, B., Soto, R., Castro, C., Monfroy, E.: Extensible CP-based autonomous search. In: Stephanidis, C. (ed.) Posters, Part I, HCII 2011. CCIS, vol.\u00a0173, pp. 561\u2013565. Springer, Heidelberg (2011)"},{"key":"89_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-38715-9_4","volume-title":"Advances in Swarm Intelligence","author":"B. Crawford","year":"2013","unstructured":"Crawford, B., Soto, R., Monfroy, E.: Cultural algorithms for the set covering problem. In: Tan, Y., Shi, Y., Mo, H. (eds.) ICSI 2013, Part II. LNCS, vol.\u00a07929, pp. 27\u201334. Springer, Heidelberg (2013)"},{"issue":"5","key":"89_CR13","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, F.: Parameter tuning of a choice-function based hyperheuristic using particle swarm optimization. Expert Systems with Applications\u00a040(5), 1690\u20131695 (2013)","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"89_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters\u00a08(2), 67\u201371 (1989)","journal-title":"Operations Research Letters"},{"issue":"6","key":"89_CR15","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"M.L. Fisher","year":"1990","unstructured":"Fisher, M.L., Kedia, P.: Optimal solution of set covering\/partitioning problems using dual heuristics. Management Science\u00a036(6), 674\u2013688 (1990)","journal-title":"Management Science"},{"key":"89_CR16","unstructured":"Yang, X.-S.: Nature-Inspired Metaheuristic Algorithms. Luniver Press (2008)"},{"key":"89_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-04944-6_14","volume-title":"Stochastic Algorithms: Foundations and Applications","author":"X.-S. Yang","year":"2009","unstructured":"Yang, X.-S.: Firefly algorithms for multimodal optimization. In: Watanabe, O., Zeugmann, T. (eds.) SAGA 2009. LNCS, vol.\u00a05792, pp. 169\u2013178. Springer, Heidelberg (2009)"}],"container-title":["Communications in Computer and Information Science","HCI International 2014 - Posters\u2019 Extended Abstracts"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07857-1_89","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T23:30:02Z","timestamp":1746228602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07857-1_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319078564","9783319078571"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07857-1_89","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]}}}