{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:06:34Z","timestamp":1743069994937,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214030"},{"type":"electronic","value":"9783319214047"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21404-7_14","type":"book-chapter","created":{"date-parts":[[2015,6,18]],"date-time":"2015-06-18T14:56:54Z","timestamp":1434639414000},"page":"187-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Comparing Cuckoo Search, Bee Colony, Firefly Optimization, and Electromagnetism-Like Algorithms for Solving the Set Covering Problem"],"prefix":"10.1007","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":"Cristian","family":"Galleguillos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge","family":"Barraza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebasti\u00e1n","family":"Lizama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexis","family":"Mu\u00f1oz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Vilches","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Misra","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":[[2015,6,19]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1007\/978-3-642-04441-0_53","volume-title":"Computational Collective Intelligence","author":"B Akay","year":"2009","unstructured":"Akay, B., Karaboga, D.: Parameter tuning for the artificial bee colony algorithm. In: Nguyen, N.T., Kowalczyk, R., Chen, S.-M. (eds.) ICCCI 2009. LNCS, vol. 5796, pp. 608\u2013619. Springer, Heidelberg (2009)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Balas, E., Carrera, M.C.: Carnegie-Mellon University. Management Sciences Research Group. A Dynamic Subgradient-based Branch and Bound Procedure for Set Covering. Management sciences research report. Management Sciences Research Group, Graduate School of Industrial Administration, Carnegie Mellon University (1992)","DOI":"10.21236\/ADA257416"},{"key":"14_CR3","unstructured":"Beasley, J.E.: http:\/\/www.brunel.ac.uk\/mastjjb\/jeb\/info.html (last visited on January 30, 2015)"},{"issue":"2","key":"14_CR4","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. European Journal of Operational Research 94(2), 392\u2013404 (1996)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1023\/A:1022452626305","volume":"25","author":"SI Birbil","year":"2003","unstructured":"Birbil, S.I., Fang, S.-C.: An electromagnetism-like mechanism for global optimization. Journal of Global Optimization 25(3), 263\u2013282 (2003)","journal-title":"Journal of Global Optimization"},{"key":"14_CR6","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 setcovering problems. Annals of Operations Research 86, 611\u2013627 (1999)","journal-title":"Annals of Operations Research"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A Caprara","year":"1995","unstructured":"Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Operations Research 47, 730\u2013743 (1995)","journal-title":"Operations Research"},{"issue":"1\u20134","key":"14_CR8","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 98(1\u20134), 353\u2013371 (2000)","journal-title":"Annals of Operations Research"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Caserta, M.: Tabu search-based metaheuristic algorithm for large-scale set covering problems. In: Doerner, K.F., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R.F., Reimann, M. (eds.) Metaheuristics. Operations Research\/Computer Science Interfaces Series, vol. 39, pp. 43\u201363. Springer, US (2007)","DOI":"10.1007\/978-0-387-71921-4_3"},{"issue":"2","key":"14_CR10","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. Mathematical Programming 81(2), 215\u2013228 (1998)","journal-title":"Mathematical Programming"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Chandrasekaran, K., Simon, S.P., Padhy, N.P.: Binary real coded firefly algorithm for solving unit commitment problem. Information Sciences 249, 67\u201384 (2013)","DOI":"10.1016\/j.ins.2013.06.022"},{"issue":"3","key":"14_CR12","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 4(3), 233\u2013235 (1979)","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"14_CR13","first-page":"106","volume":"15","author":"B Crawford","year":"2013","unstructured":"Crawford, B., Castro, C., Monfroy, E., Soto, R., Palma, W., Paredes, F.: Dynamic selection of enumeration strategies for solving constraint satisfaction problems. Romanian Journal of Information Science and Technology 15(2), 106\u2013128 (2013)","journal-title":"Romanian Journal of Information Science and Technology"},{"key":"14_CR14","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"1\u20134","key":"14_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10462-009-9127-4","volume":"31","author":"D Karaboga","year":"2009","unstructured":"Karaboga, D., Akay, B.: A survey: algorithms simulating bee swarm intelligence. Artificial Intelligence Review 31(1\u20134), 61\u201385 (2009)","journal-title":"Artificial Intelligence Review"},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm. Journal of Global Optimization 39(3), 459\u2013471 (2007)","journal-title":"Journal of Global Optimization"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Kiran, M.S., Gndz, M.: Xor-based artificial bee colony algorithm for binary optimization. Turkish Journal of Electrical Engineering and Computer Sciences 21(suppl. 2), 2307\u20132328 (2013); cited By 2","DOI":"10.3906\/elk-1203-104"},{"key":"14_CR18","unstructured":"Mirjalili, S., Hashim, S., Taherzadeh, G., Mirjalili, S.Z., Salehi, S.: A study of different transfer functions for binary version of particle swarm optimization. In: GEM 2011. CSREA Press (2011)"},{"issue":"1","key":"14_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02568529","volume":"5","author":"F Pezzella","year":"1997","unstructured":"Pezzella, F., Faggioli, E.: Solving large set covering problems for crew scheduling. Top 5(1), 41\u201359 (1997)","journal-title":"Top"},{"issue":"2","key":"14_CR20","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. Operations Research Letters 3(2), 85\u201390 (1984)","journal-title":"Operations Research Letters"},{"issue":"3","key":"14_CR21","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., Stott, K.L.: Optimal selection of ingot sizes via set covering. Oper. Res. 35(3), 346\u2013353 (1987)","journal-title":"Oper. Res."},{"key":"14_CR22","unstructured":"Yang, X.S.: Nature-Inspired Metaheuristic Algorithms. Luniver Press (2008)"},{"key":"14_CR23","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. 5792, pp. 169\u2013178. Springer, Heidelberg (2009)"},{"key":"14_CR24","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-642-29694-9_17","volume-title":"Artificial Intelligence, Evolutionary Computing and Metaheuristics","author":"X-S Yang","year":"2013","unstructured":"Yang, X.-S.: Bat algorithm and cuckoo search: a tutorial. In: Yang, X.-S. (ed.) Artificial Intelligence, Evolutionary Computing and Metaheuristics. SCI, vol. 427, pp. 421\u2013434. Springer, Heidelberg (2013)"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Yang, X.S., Deb, S.: Cuckoo Search via Levy Flights. ArXiv e-prints (March 2010)","DOI":"10.1109\/NABIC.2009.5393690"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications -- ICCSA 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21404-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:23:53Z","timestamp":1676946233000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21404-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214030","9783319214047"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21404-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"19 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}