{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:40:13Z","timestamp":1742917213506,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319420912"},{"type":"electronic","value":"9783319420929"}],"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-42092-9_18","type":"book-chapter","created":{"date-parts":[[2016,6,30]],"date-time":"2016-06-30T06:02:55Z","timestamp":1467266575000},"page":"228-240","source":"Crossref","is-referenced-by-count":3,"title":["Cat Swarm Optimization with Different Transfer Functions for Solving Set Covering Problems"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[]},{"given":"Natalia","family":"Berrios","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,1]]},"reference":[{"issue":"6","key":"18_CR1","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1287\/opre.44.6.875","volume":"44","author":"E Balas","year":"1996","unstructured":"Balas, E., Carrera, M.C.: A dynamic subgradient-based branch-and-bound procedure for set covering. Oper. Res. 44(6), 875\u2013890 (1996)","journal-title":"Oper. Res."},{"key":"18_CR2","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":"J Beasley","year":"1990","unstructured":"Beasley, J.: A lagrangian heuristic for set covering problems. Nav. Res. Logistics 37, 151\u2013164 (1990)","journal-title":"Nav. Res. Logistics"},{"issue":"2","key":"18_CR3","doi-asserted-by":"crossref","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."},{"issue":"2","key":"18_CR4","doi-asserted-by":"crossref","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."},{"key":"18_CR5","doi-asserted-by":"crossref","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."},{"key":"18_CR6","first-page":"163","volume":"3","author":"S Chu","year":"2007","unstructured":"Chu, S., Tsai, P.: Computational intelligence based on the behavior of cats. Int. J. Innovative Comput. Inf. Control 3, 163\u2013173 (2007)","journal-title":"Int. J. Innovative Comput. Inf. Control"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1007\/978-3-540-36668-3_94","volume-title":"PRICAI 2006: Trends in Artificial Intelligence","author":"S Chu","year":"2006","unstructured":"Chu, S., Tsai, P., Pan, J.: Cat swarm optimization. In: Yang, Q., Webb, G. (eds.) PRICAI 2006. LNCS (LNAI), vol. 4099, pp. 854\u2013858. Springer, Heidelberg (2006)"},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2015\/578541","volume":"2015","author":"B Crawford","year":"2015","unstructured":"Crawford, B., Soto, R., Berrios, N., Johnson, F., Paredes, F., Castro, C., Norero, E.: A binary cat swarm optimization algorithm for the non-unicost set covering problem. Math. Probl. Eng. 2015, 1\u20138 (2015). (Article ID 578541)","journal-title":"Math. Probl. Eng."},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2014\/189164","volume":"2014","author":"B Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., Cuesta, R., Paredes, F.: Application of the artificial bee colony algorithm for solving the set covering problem. Sci. World J. 2014, 1\u20138 (2014). (Article ID 189164)","journal-title":"Sci. World J."},{"key":"18_CR10","series-title":"Communications in Computer and Information Science","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/978-3-319-07857-1_86","volume-title":"HCI International 2014 - Posters\u2019 Extended Abstracts","author":"B Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., Cuesta, R., Paredes, F.: Using the bee colony optimization method to solve the weighted set covering problem. In: Stephanidis, C. (ed.) HCI 2014, Part I. CCIS, vol. 434, pp. 493\u2013497. Springer, Heidelberg (2014)"},{"key":"18_CR11","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":"19","key":"18_CR12","first-page":"4667","volume":"6","author":"B Crawford","year":"2011","unstructured":"Crawford, B., Soto, R., Monfroy, E., Paredes, F., Palma, W.: A hybrid ant algorithm for the set covering problem. Int. J. Phys. Sci. 6(19), 4667\u20134673 (2011)","journal-title":"Int. J. Phys. Sci."},{"key":"18_CR13","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)"},{"issue":"4","key":"18_CR14","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo, M., Birattari, M., St\u00fctzle, T.: Ant colony optimization. IEEE Comput. Intell. Mag. 1(4), 28\u201339 (2006)","journal-title":"IEEE Comput. Intell. Mag."},{"issue":"2","key":"18_CR15","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1080\/03052150500384759","volume":"38","author":"M Eusuff","year":"2006","unstructured":"Eusuff, M., Lansey, K., Pasha, F.: Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng. Optim. 38(2), 129\u2013154 (2006)","journal-title":"Eng. Optim."},{"issue":"6","key":"18_CR16","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"ML Fisher","year":"1990","unstructured":"Fisher, M.L., Kedia, P.: Optimal solution of set covering\/partitioning problems using dual heuristics. Manag. Sci. 36(6), 674\u2013688 (1990)","journal-title":"Manag. Sci."},{"issue":"8","key":"18_CR17","doi-asserted-by":"crossref","first-page":"B495","DOI":"10.1287\/mnsc.16.8.B495","volume":"16","author":"RS Garfinkel","year":"1970","unstructured":"Garfinkel, R.S., Nemhauser, G.L.: Optimal political districting by implicit enumeration techniques. Manag. Sci. 16(8), B495\u2013B508 (1970)","journal-title":"Manag. Sci."},{"key":"18_CR18","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."},{"issue":"3","key":"18_CR19","doi-asserted-by":"crossref","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. J. Glob. Optim. 39(3), 459\u2013471 (2007)","journal-title":"J. Glob. Optim."},{"key":"18_CR20","volume-title":"Reducibility Among Combinatorial Problems","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. Springer, Heidelberg (1972)"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-540-28646-2_1","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"L Lessing","year":"2004","unstructured":"Lessing, L., Dumitrescu, I., St\u00fctzle, T.: A comparison between ACO algorithms for the set covering problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., St\u00fctzle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 1\u201312. Springer, Heidelberg (2004)"},{"key":"18_CR22","doi-asserted-by":"crossref","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":"18_CR23","unstructured":"Mirjalili, S., Mohd, S., Taherzadeh, G., Mirjalili, S., Salehi, S.: A study of different transfer functions for binary version of particle swarm optimization. In: Swarm and Evolutionary Computation, pp. 169\u2013174 (2011)"},{"key":"18_CR24","doi-asserted-by":"crossref","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":"11","key":"18_CR25","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/mnsc.16.11.692","volume":"16","author":"C Revelle","year":"1970","unstructured":"Revelle, C., Marks, D., Liebman, J.C.: An analysis of private and public sector location models. Manag. Sci. 16(11), 692\u2013707 (1970)","journal-title":"Manag. Sci."},{"issue":"3","key":"18_CR26","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1007\/s00521-014-1743-5","volume":"26","author":"S Saremi","year":"2015","unstructured":"Saremi, S., Mirjalili, S., Lewis, A.: How important is a transfer function in discrete heuristic algorithms. Neural Comput. Appl. 26(3), 625\u2013640 (2015)","journal-title":"Neural Comput. Appl."},{"key":"18_CR27","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":"18_CR28","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.dam.2013.10.024","volume":"165","author":"B Simeone","year":"2014","unstructured":"Simeone, B., Nouno, G., Mezzadri, M., Lari, I.: A boolean theory of signatures for tonal scales. Discrete Appl. Math. 165, 283\u2013294 (2014)","journal-title":"Discrete Appl. Math."},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"Soto, R., Crawford, B., Barraza, J., Johnson, F., Paredes, F.: Solving pre-processed set covering problems via cuckoo search and l\u00e9vy flights. In: 2015 10th Iberian Conference on Information Systems and Technologies (CISTI), pp. 1\u20136 (2015)","DOI":"10.1109\/CISTI.2015.7170589"},{"issue":"6","key":"18_CR30","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1287\/opre.19.6.1363","volume":"19","author":"C Toregas","year":"1971","unstructured":"Toregas, C., Swain, R., ReVelle, C., Bergman, L.: The location of emergency service facilities. Oper. Res. 19(6), 1363\u20131373 (1971)","journal-title":"Oper. Res."},{"key":"18_CR31","doi-asserted-by":"crossref","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":"18_CR32","doi-asserted-by":"crossref","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":"1","key":"18_CR33","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0377-2217(89)90465-7","volume":"38","author":"FJ Vasko","year":"1989","unstructured":"Vasko, F.J., Wolf, F.E., Stott, K.L.: A set covering approach to metallurgical grade assignment. Eur. J. Oper. Res. 38(1), 27\u201334 (1989)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"18_CR34","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1287\/inte.19.1.68","volume":"19","author":"FJ Vasko","year":"1989","unstructured":"Vasko, F.J., Wolf, F.E., Stott, K.L., Scheirer, J.W.: Selecting optimal ingot sizes for bethlehem steel. Interfaces 19(1), 68\u201384 (1989)","journal-title":"Interfaces"},{"key":"18_CR35","doi-asserted-by":"crossref","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."},{"key":"18_CR36","doi-asserted-by":"crossref","unstructured":"Yang, X.-S., Deb, S.: Cuckoo search via l\u00e9vy flights. In: World Congress on Nature & Biologically Inspired Computing, NaBIC 2009, pp. 210\u2013214 (2009)","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"18_CR37","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1016\/j.ins.2014.03.017","volume":"277","author":"J Zhang","year":"2014","unstructured":"Zhang, J., Wei, Q., Chen, G.: A heuristic approach for $$\\lambda $$ \u03bb -representative information retrieval from large-scale data. Inf. Sci. 277, 825\u2013841 (2014)","journal-title":"Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42092-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T08:46:04Z","timestamp":1568105164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42092-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319420912","9783319420929"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42092-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}