{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:50:13Z","timestamp":1725853813271},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319336237"},{"type":"electronic","value":"9783319336251"}],"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-33625-1_46","type":"book-chapter","created":{"date-parts":[[2016,4,20]],"date-time":"2016-04-20T14:42:39Z","timestamp":1461163359000},"page":"511-524","source":"Crossref","is-referenced-by-count":2,"title":["Cat Swarm Optimization with Different Binarization Methods 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":"Natalia","family":"Berrios","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Olgu\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,21]]},"reference":[{"issue":"10","key":"46_CR1","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1057\/palgrave.jors.2601317","volume":"53","author":"U Aickelin","year":"2002","unstructured":"Aickelin, U.: An indirect genetic algorithm for set covering problems. J. Oper. Res. Soc. 1118\u20131126 (2002)","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"46_CR2","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/0377-2217(89)90471-2","volume":"38","author":"AI Ali","year":"1989","unstructured":"Ali, A.I., Thiagarajan, H.: A network relaxation based enumeration algorithm for set partitioning. Eur. J. Oper. Res. 38(1), 76\u201385 (1989)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"46_CR3","doi-asserted-by":"crossref","first-page":"2272","DOI":"10.1016\/j.asoc.2013.02.001","volume":"13","author":"Fereidoun Amini","year":"2013","unstructured":"Amini, F.,\u00a0Ghaderi, P.: Hybridization of harmony search and ant colony optimization for optimal locating of structural dampers. Appl. Soft Comput. 2272\u20132280 (2013)","journal-title":"Applied Soft Computing"},{"issue":"2","key":"46_CR4","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1287\/opre.12.2.300","volume":"12","author":"ML Balinski","year":"1964","unstructured":"Balinski, M.L., Quandt, R.E.: On an integer program for a delivery problem. Oper. Res. 12(2), 300\u2013304 (1964)","journal-title":"Oper. Res."},{"key":"46_CR5","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 Res. Logist. 37, 151\u2013164 (1990)","journal-title":"Naval Res. Logist."},{"issue":"2","key":"46_CR6","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0377-2217(92)90215-U","volume":"58","author":"J Beasley","year":"1992","unstructured":"Beasley, J., Jornsten, K.: Enhancing an algorithm for set covering problems. Eur. J. Oper. Res. 58(2), 293\u2013300 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Bellmore, M., Ratliff, H.D.: Optimal defense of multi-commodity networks. Manage. Sci. 18(4-Part-I), B174\u2013B185 (1971)","DOI":"10.1287\/mnsc.18.4.B174"},{"issue":"1","key":"46_CR8","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1145\/321556.321572","volume":"17","author":"MA Breuer","year":"1970","unstructured":"Breuer, M.A.: Simplification of the covering problem with application to boolean expressions. J. Assoc. Comput. Mach. 17(1), 166\u2013181 (1970)","journal-title":"J. Assoc. Comput. Mach."},{"key":"46_CR9","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A Caprara","year":"2000","unstructured":"Caprara, A., Fischetti, M., Toth, P.: Algorithms for the set covering problem. Ann. Oper. Res. 98, 353\u2013371 (2000)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"46_CR10","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1093\/comjnl\/14.4.418","volume":"14","author":"N Christofides","year":"1971","unstructured":"Christofides, N.: Zero-one programming using non-binary tree-search. Comput. J. 14(4), 418\u2013421 (1971)","journal-title":"Comput. J."},{"key":"46_CR11","unstructured":"Chu, S.,\u00a0Tsai, P.: Computational intelligence based on the behavior of cats. Int. J. Innov. Comput. Inf. Control 163\u2013173 (2007)"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Chu, S.,\u00a0Tsai, P.,\u00a0Pan, J.: Cat swarm optimization. In: Trends in Artificial Intelligence, pp. 854\u2013858. Springer, Berlin, Heidelberg (2006)","DOI":"10.1007\/978-3-540-36668-3_94"},{"key":"46_CR13","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/978-3-319-21410-8_33","volume-title":"Computational Science and Its Applications -- ICCSA 2015","author":"Broderick Crawford","year":"2015","unstructured":"Crawford, B.,\u00a0Soto, R.,\u00a0Aballay, F.,\u00a0Misra, S.,\u00a0Johnson, F.,\u00a0Paredes, F.: A teaching-learning-based optimization algorithm for solving set covering problems. In: Computational Science and Its Applications, pp. 421\u2013430 (2015)"},{"key":"46_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2015\/578541","volume":"2015","author":"Broderick Crawford","year":"2015","unstructured":"Crawford, B.,\u00a0Soto, R.,\u00a0Berrios, N.,\u00a0Johnson, F.,\u00a0Paredes, F.,\u00a0Castro, C.,\u00a0Norero, E.: A binary cat swarm optimization algorithm for the non-unicost set covering problem. Math. Probl. Eng. 2015(Article ID 578541), 1\u20138 (2015)","journal-title":"Mathematical Problems in Engineering"},{"key":"46_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2014\/189164","volume":"2014","author":"Broderick Crawford","year":"2014","unstructured":"Crawford, B.,\u00a0Soto, R.,\u00a0Cuesta, R.,\u00a0Paredes, F.: Application of the artificial bee colony algorithm for solving the set covering problem. Sci. World J. 2014(Article ID 189164), 1\u20138 (2014)","journal-title":"The Scientific World Journal"},{"key":"46_CR16","first-page":"27","volume-title":"Lecture Notes in Computer Science","author":"Broderick 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.) Advances in Swarm Intelligence. 4th International Conference. Lecture Notes in Computer Science, vol. 7929, pp. 27\u201334. Springer, Harbin, China (2013)"},{"issue":"5","key":"46_CR17","doi-asserted-by":"crossref","first-page":"1690","DOI":"10.1016\/j.eswa.2012.09.013","volume":"40","author":"Broderick Crawford","year":"2013","unstructured":"Crawford, B.,\u00a0Soto, R.,\u00a0Monfroy, E.,\u00a0Palma, W.,\u00a0Castro, C.,\u00a0Paredes, F.: Parameter tuning of a choice-a function based hyperheuristic using particle swarm optimization. Expert Syst. Appl. 1690\u20131695 (2013)","journal-title":"Expert Systems with Applications"},{"key":"46_CR18","first-page":"252","volume":"17","author":"B Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., Olivares-Su\u00e1rez, M., Palma, W., Paredes, F., Olguin, E., Norero, E.: A binary coded firefly algorithm that solves the set covering problem. Rom. J. Inf. Sci. Technol. 17, 252\u2013264 (2014)","journal-title":"Rom. J. Inf. Sci. Technol."},{"key":"46_CR19","doi-asserted-by":"crossref","unstructured":"Crawford, B.,\u00a0Soto, R.,\u00a0Olivares-Su\u00e1rez, M.,\u00a0Paredes, F.: A binary firefly algorithm for the set covering problem. In: 3rd Computer Science On-line Conference 2014, Modern Trends and Techniques in Computer Science, vol. 285, pp. 65\u201373. Springer (2014)","DOI":"10.1007\/978-3-319-06740-7_6"},{"key":"46_CR20","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-319-15705-4_5","volume-title":"Intelligent Information and Database Systems","author":"Broderick 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., Trawinski, B., Kosala, R. (eds.) Intelligent Information and Database Systems\u20147th Asian Conference. LNCS, vol. 9012, pp. 41\u201350. Springer, Bali, Indonesia (2015)"},{"issue":"3","key":"46_CR21","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1287\/opre.13.3.482","volume":"13","author":"RH Day","year":"1965","unstructured":"Day, R.H.: Letter to the editor on optimal extracting from a multiple file data storage system: an application of integer programming. Oper. Res. 13(3), 482\u2013494 (1965)","journal-title":"Oper. Res."},{"issue":"1","key":"46_CR22","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":"ML Fisher","year":"1989","unstructured":"Fisher, M.L., Rosenwein, M.B.: An interactive optimization system for bulk-cargo ship scheduling. Naval Res. Logist. 36(1), 27\u201342 (1989)","journal-title":"Naval Res. Logist."},{"key":"46_CR23","first-page":"361","volume":"18","author":"BA Freeman","year":"1967","unstructured":"Freeman, B.A., Jucker, J.V.: The line balancing problem. J. Ind. Eng. 18, 361\u2013364 (1967)","journal-title":"J. Ind. Eng."},{"key":"46_CR24","unstructured":"Goldberg, D.: Real-coded genetic algorithms, virtual alphabets, and blocking. Complex Syst. 139\u2013167 (1990)"},{"key":"46_CR25","first-page":"20","volume":"39","author":"D Gouwanda","year":"2008","unstructured":"Gouwanda, D., Ponnambalam, S.: Evolutionary search techniques to solve set covering problems. World Acad. Sci. Eng. Technol. 39, 20\u201325 (2008)","journal-title":"World Acad. Sci. Eng. Technol."},{"key":"46_CR26","first-page":"1","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"Lucas Lessing","year":"2004","unstructured":"Lessing, L.,\u00a0Dumitrescu, I.,\u00a0Stutzle, T.: A comparison between aco algorithms for the set covering problem. In: Ant Colony Optimization and Swarm Intelligence, pp. 1\u201312 (2004)"},{"key":"46_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.09.002","volume":"9","author":"S Mirjalili","year":"2013","unstructured":"Mirjalili, S., Lewis, A.: S-shaped versus v-shaped transfer functions for binary particle swarm optimization. Swarm Evol. Comput. 9, 1\u201314 (2013)","journal-title":"Swarm Evol. Comput."},{"key":"46_CR28","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., Majhi, B.: IIR system identification using cat swarm optimization. Expert Syst. Appl. 38, 12671\u201312683 (2011)","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"46_CR29","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1016\/j.cie.2010.02.011","volume":"58","author":"Zhi-Gang Ren","year":"2010","unstructured":"Ren, Z.,\u00a0Feng, Z.,\u00a0Ke, L.,\u00a0Zhang, Z.: New ideas for applying ant colony optimization to the set covering problem. Comput. Ind. Eng. 774\u2013784 (2010)","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"46_CR30","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/0377-2217(89)90389-5","volume":"41","author":"CC Ribeiro","year":"1989","unstructured":"Ribeiro, C.C., Minoux, M., Penna, M.C.: An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment. Eur. J. Oper. Res. 41(2), 232\u2013239 (1989)","journal-title":"Eur. J. Oper. Res."},{"key":"46_CR31","doi-asserted-by":"crossref","unstructured":"Sharafi, Y., Khanesar, M., Teshnehlab, M.: Discrete binary cat swarm optimization algorithm. In: Computer, Control and Communication, pp. 1\u20136 (2013)","DOI":"10.1109\/IC4.2013.6653754"},{"key":"46_CR32","doi-asserted-by":"publisher","first-page":"6309","DOI":"10.1016\/j.eswa.2011.11.117","volume":"39","author":"P Tsai","year":"2012","unstructured":"Tsai, P., Pan, J., Chen, S., Liao, B.: Enhanced parallel cat swarm optimization based on the Taguchi method. Expert Syst. Appl. 39, 6309\u20136319 (2012)","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"46_CR33","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":"46_CR34","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, 275\u2013277 (1974)","journal-title":"Oper. Res."}],"container-title":["Advances in Intelligent Systems and Computing","Artificial Intelligence Perspectives in Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-33625-1_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T18:27:21Z","timestamp":1692296841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33625-1_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319336237","9783319336251"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33625-1_46","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2016]]}}}