{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:01:20Z","timestamp":1742976080401,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319420066"},{"type":"electronic","value":"9783319420073"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42007-3_76","type":"book-chapter","created":{"date-parts":[[2016,7,13]],"date-time":"2016-07-13T04:38:22Z","timestamp":1468384702000},"page":"892-903","source":"Crossref","is-referenced-by-count":0,"title":["An Artificial Fish Swarm Optimization Algorithm to Solve 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":"Eduardo","family":"Olgu\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebasti\u00e1n Mansilla","family":"Villablanca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c1lvaro G\u00f3mez","family":"Rubio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adri\u00e1n","family":"Jaramillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Salas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,14]]},"reference":[{"key":"76_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":"76_CR2","doi-asserted-by":"crossref","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":"76_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2014\/189164","volume":"2014","author":"B Crawford","year":"2014","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, 1\u20138 (2014)","journal-title":"Sci. World J."},{"key":"76_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"76_CR5","doi-asserted-by":"crossref","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":"76_CR6","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":"76_CR7","doi-asserted-by":"crossref","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":"76_CR8","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, Cham (2015)"},{"key":"76_CR9","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":"76_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic Algorithms $$+$$ Data Structures $$=$$ Evolution Programs","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz, Z.: Genetic Algorithms $$+$$ Data Structures $$=$$ Evolution Programs, 3rd edn. Springer, Heidelberg (1996)","edition":"3"},{"key":"76_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"76_CR12","doi-asserted-by":"crossref","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."},{"key":"76_CR13","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s10852-015-9275-2","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, 313\u2013330 (2015)","journal-title":"J. Math. Model. Algorithms Oper. Res."},{"key":"76_CR14","doi-asserted-by":"crossref","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, pp. 37\u201360. Springer, Heidelberg (1980)"},{"issue":"1","key":"76_CR15","doi-asserted-by":"crossref","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":"76_CR16","doi-asserted-by":"crossref","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. Logist. (NRL) 37(1), 151\u2013164 (1990)","journal-title":"Naval Res. Logist. (NRL)"}],"container-title":["Lecture Notes in Computer Science","Trends in Applied Knowledge-Based Systems and Data Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42007-3_76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T22:57:22Z","timestamp":1568156242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42007-3_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319420066","9783319420073"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42007-3_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}