{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T04:18:00Z","timestamp":1749010680866,"version":"3.41.0"},"publisher-location":"Cham","reference-count":29,"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_17","type":"book-chapter","created":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T06:50:27Z","timestamp":1467355827000},"page":"220-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Solving Biobjective Set Covering Problem Using Binary Cat Swarm Optimization Algorithm"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[]},{"given":"Hugo","family":"Caballero","sequence":"additional","affiliation":[]},{"given":"Eduardo","family":"Olgu\u00edn","sequence":"additional","affiliation":[]},{"given":"Sanjay","family":"Misra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Cuesta, R., Olivares-Su\u00e1rez, M., Johnson, F., Olguin, E.: Two swarm intelligence algorithms for the set covering problem. In: 2014 9th International Conference on Software Engineering and Applications (ICSOFT-EA), pp. 60\u201369. IEEE (2014)","DOI":"10.5220\/0005093500600069"},{"key":"17_CR2","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":"17_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2015","year":"2015","unstructured":"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. Springer, Heidelberg (2015)"},{"key":"17_CR4","unstructured":"Lopez, J., Lanzarini, L.C., Leguizam\u00f3n, G.: Optimizaci\u00f3n multiobjetivo: aplicaciones a problemas del mundo real. Buenos Aires, Argentina, Universidad Nacional de la Plata, pp. 66\u201390 (2013)"},{"key":"17_CR5","unstructured":"Wikipedia, Problema del conjunto de cobertura \u2013 wikipedia, la enciclopedia libre (2014). [Internet; descargado 29-octubre-2015]"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/BFb0056872","volume-title":"Parallel Problem Solving from Nature\u2014PPSN V","author":"E Zitzler","year":"1998","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms\u2013a comparative case study. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature\u2014PPSN V. LNCS, vol. 1498, pp. 292\u2013301. Springer, Heidelberg (1998)"},{"key":"17_CR7","unstructured":"Wikipedia, Pareto efficiency \u2013 wikipedia, the free encyclopedia (2015). Accessed 29 Oct 2015"},{"key":"17_CR8","unstructured":"Knowles, J., Corne, D.: The pareto archived evolution strategy: a new baseline algorithm for pareto multiobjective optimisation. In: Proceedings of the 1999 Congress on Evolutionary Computation, 1999, CEC 99, vol. 1, IEEE (1999)"},{"issue":"1\u20134","key":"17_CR9","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. Ann. Oper. Res. 98(1\u20134), 353\u2013371 (2000)","journal-title":"Ann. Oper. Res."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Berrios, N., Johnson, F., Paredes, F.: Binary cat swarm optimization for the set covering problem pp. 1\u20134 (2015)","DOI":"10.1155\/2015\/578541"},{"issue":"1","key":"17_CR11","first-page":"163","volume":"3","author":"S-C Chu","year":"2007","unstructured":"Chu, S.-C., Tsai, P.-W.: Computational intelligence based on the behavior of cats. Int. J. Innovative Comput. Inf. Control 3(1), 163\u2013173 (2007)","journal-title":"Int. J. Innovative Comput. Inf. Control"},{"issue":"1","key":"17_CR12","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. Nav. Res. Logistics (NRL) 37(1), 151\u2013164 (1990)","journal-title":"Nav. Res. Logistics (NRL)"},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"2956","DOI":"10.1016\/j.eswa.2011.08.157","volume":"39","author":"PM Pradhan","year":"2012","unstructured":"Pradhan, P.M., Panda, G.: Solving multiobjective problems using cat swarm optimization. Expert Syst. Appl. 39(3), 2956\u20132964 (2012)","journal-title":"Expert Syst. Appl."},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1007\/978-3-540-36668-3_94","volume-title":"PRICAI 2006: Trends in Artificial Intelligence","author":"S-C Chu","year":"2006","unstructured":"Chu, S.-C., Tsai, P., Pan, J.-S.: Cat swarm optimization. In: Yang, Q., Webb, G. (eds.) PRICAI 2006. LNCS (LNAI), vol. 4099, pp. 854\u2013858. Springer, Heidelberg (2006)"},{"issue":"10","key":"17_CR15","doi-asserted-by":"publisher","first-page":"12671","DOI":"10.1016\/j.eswa.2011.04.054","volume":"38","author":"G Panda","year":"2011","unstructured":"Panda, G., Pradhan, P.M., Majhi, B.: IIR system identification using cat swarm optimization. Expert Syst. Appl. 38(10), 12671\u201312683 (2011)","journal-title":"Expert Syst. Appl."},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Lust, T., Tuyttens, D.: Two-phase pareto local search to solve the biobjective set covering problem. In: 2013 Conference on Technologies and Applications of Artificial Intelligence (TAAI), pp. 397\u2013402. IEEE (2013)","DOI":"10.1109\/TAAI.2013.85"},{"issue":"10","key":"17_CR17","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1016\/j.advengsoft.2011.05.014","volume":"42","author":"JJ Durillo","year":"2011","unstructured":"Durillo, J.J., Nebro, A.J.: jmetal: A java framework for multi-objective optimization. Ad. Eng. Softw. 42(10), 760\u2013771 (2011)","journal-title":"Ad. Eng. Softw."},{"key":"17_CR18","unstructured":"Wikipedia, Optimizaci\u00f3n multiobjetivo \u2013 wikipedia, la enciclopedia libre (2013). [Internet; descargado 29-octubre-2015]"},{"issue":"4","key":"17_CR19","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1162\/EVCO_a_00003","volume":"18","author":"T Friedrich","year":"2010","unstructured":"Friedrich, T., He, J., Hebbinghaus, N., Neumann, F., Witt, C.: Approximating covering problems by randomized search heuristics using multi-objective models*. Evol. Comput. 18(4), 617\u2013633 (2010)","journal-title":"Evol. Comput."},{"key":"17_CR20","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2013","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer Science & Business Media, New York (2013)"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Bouzidi, A., Riffi, M.E.: Cat swarm optimization to solve flow shop scheduling problem. J. Theor. Appl. Inf. Technol. 72(2) (2015)","DOI":"10.1109\/CIST.2014.7016619"},{"issue":"1","key":"17_CR22","doi-asserted-by":"publisher","first-page":"279","DOI":"10.14257\/ijhit.2015.8.1.25","volume":"8","author":"I Hadi","year":"2015","unstructured":"Hadi, I., Sabah, M.: Improvement cat swarm optimization for efficient motion estimation. Int. J. Hybrid Inf. Technol. 8(1), 279\u2013294 (2015)","journal-title":"Int. J. Hybrid Inf. Technol."},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/11779568_34","volume-title":"Advances in Applied Artificial Intelligence","author":"N Musliu","year":"2006","unstructured":"Musliu, N.: Local search algorithm for unicost set covering problem. In: Ali, M., Dapoigny, R. (eds.) IEA\/AIE 2006. LNCS (LNAI), vol. 4031, pp. 302\u2013311. Springer, Heidelberg (2006)"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, L.-B., Zhou, C.-G., Liu, X., Ma, Z., Ma, M., Liang, Y.: Solving multi objective optimization problems using particle swarm optimization. In: Proceedings of IEEE congress on evolutionary computation, pp. 2400\u20132405 (2003)","DOI":"10.1109\/CEC.2003.1299388"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Aballay Leiva, F., Johnson, F., Paredes, F.: The set covering problem solved by the binary teaching-learning-based optimization algorithm. In: 2015 10th Iberian Conference on Information Systems and Technologies (CISTI), pp. 1\u20134. IEEE (2015)","DOI":"10.1109\/CISTI.2015.7170401"},{"key":"17_CR26","series-title":"Advances in Intelligent Systems and Computing","first-page":"317","volume-title":"Software Engineering in Intelligent Systems","author":"B Crawford","year":"2013","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. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Prokopova, Z., Silhavy, P. (eds.) Software Engineering in Intelligent Systems. AISC, vol. 349, pp. 317\u2013326. Springer, Heidelberg (2013)"},{"key":"17_CR27","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":"17_CR28","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":"17_CR29","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.) Modern Trends and Techniques in Computer Science. AISC, vol. 285, pp. 53\u201363. Springer, Heidelberg (2014)"}],"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_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T23:26:44Z","timestamp":1748993204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42085-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319420844","9783319420851"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42085-1_17","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"}}]}}