{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:15:14Z","timestamp":1748405714571,"version":"3.41.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319184722"},{"type":"electronic","value":"9783319184739"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18473-9_30","type":"book-chapter","created":{"date-parts":[[2015,4,25]],"date-time":"2015-04-25T10:00:08Z","timestamp":1429956008000},"page":"307-315","source":"Crossref","is-referenced-by-count":9,"title":["Modified Binary FireFly Algorithms with Different Transfer Functions for Solving Set Covering Problems"],"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":"Marco","family":"Riquelme-Leiva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristian","family":"Pe\u00f1a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio","family":"Torres-Rojas","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"}]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Balachandar, S.R., Kannan, K.: A meta-heuristic algorithm for set covering problem based on gravity\u00a04(7), 944\u2013950 (2010)"},{"issue":"6","key":"30_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"},{"key":"30_CR3","series-title":"Mathematical Programming Studies","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BFb0120886","volume-title":"Combinatorial Optimization","author":"E. Balas","year":"1980","unstructured":"Balas, E., Ho, A.: Set Covering Algorithms Using Cutting Planes, Heuristics, and Subgradient Optimization: a Computational Study. In: Padberg, M.W. (ed.) Combinatorial Optimization. Mathematical Programming Studies, vol.\u00a012, pp. 37\u201360. Elsevier, North-Holland (1980)"},{"issue":"1","key":"30_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. Beasley","year":"1990","unstructured":"Beasley, J.: 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":"30_CR5","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":"30_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","volume":"31","author":"J.E. Beasley","year":"1987","unstructured":"Beasley, J.E.: An algorithm for set covering problem. European Journal of Operational Research\u00a031(1), 85\u201393 (1987)","journal-title":"European Journal of Operational Research"},{"issue":"1-3","key":"30_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF02614316","volume":"79","author":"E. Boros","year":"1997","unstructured":"Boros, E., Hammer, P.L., Ibaraki, T., Kogan, A.: Logical analysis of numerical data. Mathematical Programming\u00a079(1-3), 163\u2013190 (1997)","journal-title":"Mathematical Programming"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1023\/A:1018900128545","volume":"86","author":"M. Brusco","year":"1999","unstructured":"Brusco, M., Jacobs, L., Thompson, G.: 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"},{"issue":"5","key":"30_CR9","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.\u00a047(5), 730\u2013743 (1999)","journal-title":"Oper. Res."},{"key":"30_CR10","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. Operations Research\/Computer Science Interfaces Series, vol.\u00a039, pp. 43\u201363. Springer US (2007)","DOI":"10.1007\/978-0-387-71921-4_3"},{"issue":"3","key":"30_CR11","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. Mathematics of Operations Research\u00a04(3), 233\u2013235 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Cuesta, R., Paredes, F.: Application of the artificial bee colony algorithm for solving the set covering problem. The Scientific World Journal\u00a0(2014)","DOI":"10.2495\/CEEIT140051"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Monfroy, E., Castro, C., Palma, W., Paredes, F.: A hybrid soft computing approach for subset problems. Mathematical Problems in Engineering, Article ID 716069, 1\u201312 (2013)","DOI":"10.1155\/2013\/716069"},{"key":"30_CR14","series-title":"AISC","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-06740-7_6","volume-title":"Modern Trends and Techniques in Computer Science","author":"B. Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., Olivares-Su\u00e1rez, M., Paredes, F.: A binary firefly algorithm for the set covering problem. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Silhavy, P., Prokopova, Z. (eds.) Modern Trends and Techniques in Computer Science. AISC, vol.\u00a0285, pp. 65\u201373. Springer, Heidelberg (2014)"},{"key":"30_CR15","series-title":"CCIS","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-319-07857-1_89","volume-title":"HCI International 2014 - Posters\u2019 Extended Abstracts","author":"B. Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., Olivares-Su\u00e1rez, M., Paredes, F.: Using the firefly optimization method to solve the weighted set covering problem. In: Stephanidis, C. (ed.) HCII 2014 Posters, Part I. CCIS, vol.\u00a0434, pp. 509\u2013514. Springer, Heidelberg (2014)"},{"key":"30_CR16","series-title":"AISC","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-319-06740-7_5","volume-title":"Modern Trends and Techniques in Computer Science","author":"R. Cuesta","year":"2014","unstructured":"Cuesta, R., Crawford, B., Soto, R., Paredes, F.: An artificial bee colony algorithm for the set covering problem. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Silhavy, P., Prokopova, Z. (eds.) Modern Trends and Techniques in Computer Science. AISC, vol.\u00a0285, pp. 53\u201363. Springer, Heidelberg (2014)"},{"issue":"3","key":"30_CR17","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1061\/(ASCE)0733-9496(2003)129:3(210)","volume":"129","author":"M.M. Eusuff","year":"2003","unstructured":"Eusuff, M.M., Lansey, K.E.: Optimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm. Journal of Water Resources Planning and Management\u00a0129(3), 210\u2013225 (2003)","journal-title":"Journal of Water Resources Planning and Management"},{"issue":"6","key":"30_CR18","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"},{"issue":"1","key":"30_CR19","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1002\/1520-6750(198902)36:1<27::AID-NAV3220360103>3.0.CO;2-0","volume":"36","author":"M.L. Fisher","year":"1989","unstructured":"Fisher, M.L., Rosenwein, M.B.: An interactive optimization system for bulk-cargo ship scheduling. Naval Research Logistics (NRL)\u00a036(1), 27\u201342 (1989)","journal-title":"Naval Research Logistics (NRL)"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Foster, B.A., Ryan, D.M.: An integer programming approach to the vehicle scheduling problem. Operational Research Quarterly, 367\u2013384 (1976)","DOI":"10.1057\/jors.1976.63"},{"key":"30_CR21","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. 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)"},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"Glover, F.W., Kochenberger, G.A.: Handbook of Metaheuristics (International Series in Operations Research & Management Science). Springer (January 2003)","DOI":"10.1007\/b101874"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: IEEE International Conference on Neural Networks, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"30_CR24","unstructured":"Mirjalili, S., Hashim, S.M., Taherzadeh, G., Mirjalili, S., Salehi, S.: A study of different transfer functions for binary version of particle swarm optimization. In: GEM 2011. CSREA Press (2011)"},{"issue":"2","key":"30_CR25","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. European Journal of Operational Research\u00a0205(2), 290\u2013300 (2010)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"30_CR26","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.cie.2010.02.011","volume":"58","author":"Z.-G. 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. Computers & Industrial Engineering\u00a058(4), 774\u2013784 (2010)","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"30_CR27","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01589402","volume":"42","author":"B.M. Smith","year":"1988","unstructured":"Smith, B.M.: Impacs a bus crew scheduling system using integer programming. Mathematical Programming\u00a042(1), 181\u2013187 (1988)","journal-title":"Mathematical Programming"},{"issue":"6","key":"30_CR28","doi-asserted-by":"publisher","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.: The location of emergency service facilities. Operations Research\u00a019(6), 1363\u20131373 (1971)","journal-title":"Operations Research"},{"issue":"1","key":"30_CR29","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0377-2217(89)90465-7","volume":"38","author":"F.J. Vasko","year":"1989","unstructured":"Vasko, F.J., Wolf, F.E., Stott Jr., K.L.: A set covering approach to metallurgical grade assignment. European Journal of Operational Research\u00a038(1), 27\u201334 (1989)","journal-title":"European Journal of Operational Research"},{"key":"30_CR30","unstructured":"Yang, X.-S.: Nature-inspired metaheuristic algorithms. Luniver Press (2010)"}],"container-title":["Advances in Intelligent Systems and Computing","Software Engineering in Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18473-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T14:39:58Z","timestamp":1748356798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-18473-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319184722","9783319184739"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18473-9_30","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}