{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:50:20Z","timestamp":1742993420041,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319420844"},{"type":"electronic","value":"9783319420851"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42085-1_13","type":"book-chapter","created":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T02:50:27Z","timestamp":1467341427000},"page":"166-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Solutions of the Set Covering Problem with an Artificial Fish Swarm Algorithm Optimization"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[]},{"given":"Eduardo","family":"Olgu\u00edn","sequence":"additional","affiliation":[]},{"given":"Sanjay","family":"Misra","sequence":"additional","affiliation":[]},{"given":"Sebasti\u00e1n Mansilla","family":"Villablanca","sequence":"additional","affiliation":[]},{"given":"\u00c1lvaro G\u00f3mez","family":"Rubio","sequence":"additional","affiliation":[]},{"given":"Adri\u00e1n","family":"Jaramillo","sequence":"additional","affiliation":[]},{"given":"Juan","family":"Salas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"13_CR1","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)"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.2495\/CEEIT140051","volume":"63","author":"B Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., Aguilar, R.C., Paredes, F.: A new artificial bee colony algorithm for set covering problems. Electr. Eng. Inf. Technol. 63, 31 (2014)","journal-title":"Electr. Eng. Inf. Technol."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Aguilar, R.C., Paredes, F.: Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem. Sci. World J. 2014 (2014)","DOI":"10.2495\/CEEIT140051"},{"key":"13_CR4","series-title":"Advances in Intelligent Systems and Computing","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.) CSOC 2014. AISC, vol. 285, pp. 53\u201363. Springer, Switzerland (2014)"},{"key":"13_CR5","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. 7929, pp. 27\u201334. Springer, Heidelberg (2013)"},{"issue":"5","key":"13_CR6","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 Syst. Appl. 40(5), 1690\u20131695 (2013)","journal-title":"Expert Syst. Appl."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Monfroy, E., Paredes, F., Palma, W.: A hybrid Ant algorithm for the set covering problem (2014)","DOI":"10.1155\/2014\/189164"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-06740-7_6","volume":"285","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. Modern Trends Tech. Comput. Sci. 285, 65\u201373 (2014)","journal-title":"Modern Trends Tech. Comput. Sci."},{"key":"13_CR9","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/978-3-319-18473-9_30","volume-title":"Software Engineering in Intelligent Systems","author":"B Crawford","year":"2015","unstructured":"Crawford, B., Soto, R., Riquelme-Leiva, M., Pe\u00f1a, C., Torres-Rojas, C., Johnson, F., Paredes, F.: Modified binary firefly algorithms with different transfer functions for solving set covering problems. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Prokopova, Z., Silhavy, P. (eds.) CSOC 2015. AISC, vol. 349, pp. 307\u2013315. Springer, Switzerland (2015)"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.2495\/CEEIT140081","volume":"63","author":"B Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., Olivares-Su\u00e1rez, M., Paredes, F.: A new approach using a binary firefly algorithm for the set covering problem. WIT Trans. Inf. Commun. Technol. 63, 51\u201356 (2014)","journal-title":"WIT Trans. Inf. Commun. Technol."},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","first-page":"41","volume-title":"Intelligent Information and Database Systems","author":"B Crawford","year":"2015","unstructured":"Crawford, B., Soto, R., Pe\u00f1a, C., Palma, W., Johnson, F., Paredes, F.: Solving the set covering problem with a shuffled frog leaping algorithm. In: Nguyen, N.T., Trawi\u0144ski, B., Kosala, R. (eds.) ACIIDS 2015. LNCS, vol. 9012, pp. 41\u201350. Springer, Heidelberg (2015)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Pe\u00f1a, C., Riquelme-Leiva, M., Torres-Rojas, C., Johnson, F., Paredes, F.: Binarization methods for shuffled frog leaping algorithms that solve set covering problems. Software Engineering in Intelligent Systems, pp. 317\u2013326 (2015)","DOI":"10.1007\/978-3-319-18473-9_31"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-319-21410-8_32","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2015","author":"B Crawford","year":"2015","unstructured":"Crawford, B., Soto, R., Torres-Rojas, C., Pe\u00f1a, C., Riquelme-Leiva, M., Misra, S., Johnson, F., Paredes, F.: A binary fruit fly optimization algorithm to solve the set covering problem. In: Gervasi, O., Murgante, B., Misra, S., Gavrilova, M.L., Rocha, A.M.A.C., Torre, C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2015. LNCS, vol. 9158, pp. 411\u2013420. Springer, Heidelberg (2015)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-319-21410-8_33","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2015","author":"B Crawford","year":"2015","unstructured":"Crawford, B., Soto, R., Aballay, F., Misra, S., Johnson, F., Paredes, F.: A teaching-learning-based optimization algorithm for solving set covering problems. In: Gervasi, O., Murgante, B., Misra, S., Gavrilova, M.L., Rocha, A.M.A.C., Torre, C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2015. LNCS, vol. 9158, pp. 421\u2013430. Springer, Heidelberg (2015)"},{"key":"13_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic Algorithms $$+$$ Data Structures","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz, Z.: Genetic Algorithms \n                      \n                        \n                      \n                      $$+$$\n                     Data Structures \n                      \n                        \n                      \n                      $$=$$\n                     Evolution Programs, 3rd edn. Springer, Heidelberg (1996)","edition":"3"},{"key":"13_CR16","volume-title":"Genetic Algorithms $$+$$ Data Structures","author":"Z Michalewicz","year":"2013","unstructured":"Michalewicz, Z.: Genetic Algorithms \n                      \n                        \n                      \n                      $$+$$\n                     Data Structures \n                      \n                        \n                      \n                      $$=$$\n                     Evolution Programs. Springer Science & Business Media, Heidelberg (2013)"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-319-21404-7_14","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2015","author":"R Soto","year":"2015","unstructured":"Soto, R., Crawford, B., Galleguillos, C., Barraza, J., Lizama, S., Mu\u00f1oz, A., Vilches, J., Misra, S., Paredes, F.: Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving the set covering problem. In: Gervasi, O., Murgante, B., Misra, S., Gavrilova, M.L., Rocha, A.M.A.C., Torre, C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2015. LNCS, vol. 9155, pp. 187\u2013202. Springer, Heidelberg (2015)"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-319-21410-8_34","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2015","author":"B Crawford","year":"2015","unstructured":"Crawford, B., Soto, R., Pe\u00f1a, C., Riquelme-Leiva, M., Torres-Rojas, C., Misra, S., Johnson, F., Paredes, F.: A comparison of three recent nature-inspired metaheuristics for the set covering problem. In: Gervasi, O., Murgante, B., Misra, S., Gavrilova, M.L., Rocha, A.M.A.C., Torre, C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2015. LNCS, vol. 9158, pp. 431\u2013443. Springer, Heidelberg (2015)"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-31137-6_6","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2012","author":"MAK Azad","year":"2012","unstructured":"Azad, M.A.K., Rocha, A.M.A.C., Fernandes, E.M.G.P.: Solving multidimensional 0\u20131 knapsack problem with an artificial fish swarm algorithm. In: Murgante, B., Gervasi, O., Misra, S., Nedjah, N., Rocha, A.M.A.C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2012, Part III. LNCS, vol. 7335, pp. 72\u201386. Springer, Heidelberg (2012)"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.swevo.2013.09.002","volume":"14","author":"MAK Azad","year":"2014","unstructured":"Azad, M.A.K., Rocha, A.M.A., Fernandes, E.M.: Improved binary artificial fish swarm algorithm for the 0\u20131 multidimensional knapsack problems. Swarm Evol. Comput. 14, 66\u201375 (2014)","journal-title":"Swarm Evol. Comput."},{"issue":"3","key":"13_CR21","first-page":"1","volume":"14","author":"MAK Azad","year":"2015","unstructured":"Azad, M.A.K., Rocha, A.M.A., Fernandes, E.M.: Solving large 0\u20131 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm. J. Math. Model. Algorithms Oper. Res. 14(3), 1\u201318 (2015)","journal-title":"J. Math. Model. Algorithms Oper. Res."},{"key":"13_CR22","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, vol. 12, pp. 37\u201360. Springer, Heidelberg (1980)"},{"issue":"1","key":"13_CR23","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","volume":"31","author":"JE Beasley","year":"1987","unstructured":"Beasley, J.E.: An algorithm for set covering problem. Eur. J. Oper. Res. 31(1), 85\u201393 (1987)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"13_CR24","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 (NRL) 37(1), 151\u2013164 (1990)","journal-title":"Naval Res. Logistics (NRL)"},{"issue":"3","key":"13_CR25","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."},{"issue":"2","key":"13_CR26","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1287\/opre.22.2.275","volume":"22","author":"W Walker","year":"1974","unstructured":"Walker, W.: Using the set-covering problem to assign fire companies to fire houses. Oper. Res. 22(2), 275\u2013277 (1974)","journal-title":"Oper. Res."},{"issue":"2","key":"13_CR27","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."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2016"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42085-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:59:14Z","timestamp":1558313954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42085-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319420844","9783319420851"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42085-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"21 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}