{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:38:46Z","timestamp":1742924326945,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"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_29","type":"book-chapter","created":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T02:50:27Z","timestamp":1467341427000},"page":"373-385","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Approach to Solve the Set Covering Problem with the Soccer League Competition Algorithm"],"prefix":"10.1007","author":[{"given":"Adri\u00e1n","family":"Jaramillo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Olgu\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c1lvaro G\u00f3mez","family":"Rubio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Salas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebasti\u00e1n Mansilla","family":"Villablanca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"29_CR1","unstructured":"OR-Library a collection of test data sets for a variety of operations research (or) problems. \n                      http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/scpinfo.html\n                      \n                    . Accessed 30 Mar 2015"},{"key":"29_CR2","unstructured":"PyPyODBC a pure python odbc module by ctypes. \n                      https:\/\/pypi.python.org\/pypi\/pypyodbc\n                      \n                    . Accessed 20 Jan 2015"},{"issue":"11","key":"29_CR3","doi-asserted-by":"publisher","first-page":"2192","DOI":"10.1109\/LCOMM.2013.091913.131765","volume":"17","author":"SN Agathos","year":"2013","unstructured":"Agathos, S.N., Papapetrou, E.: On the set cover problem for broadcasting in wireless ad hoc networks. IEEE Commun. Lett. 17(11), 2192\u20132195 (2013)","journal-title":"IEEE Commun. Lett."},{"key":"29_CR4","unstructured":"Cormode, G., Karloff, H., Wirth, A.: Set cover algorithms for very large datasets. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management, CIKM 2010, pp. 479\u2013488. ACM, New York (2010). \n                      http:\/\/doi.acm.org\/10.1145\/1871437.1871501"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Cuesta, R., Olivares-Su\u00e1rez, M., Johnson, F., Olgu\u00edn, E.: Two swarm intelligence algorithms for the set covering problem. In: ICSOFT-EA 2014 - Proceedings of the 9th International Conference on Software Engineering and Applications, Vienna, Austria, 29\u201331 August, pp. 60\u201369 (2014)","DOI":"10.5220\/0005093500600069"},{"key":"29_CR6","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","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":"29_CR7","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)"},{"key":"29_CR8","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-319-07857-1_89","volume-title":"HCI International 2014 - Posters\u2019 Extended Abstracts","author":"B Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., Olivares-Su\u00e1rez, M., Paredes, F.: Using the firefly optimization method to solve the weighted set covering problem. In: Stephanidis, C. (ed.) HCI 2014, Part I. CCIS, vol. 434, pp. 509\u2013514. Springer, Heidelberg (2014)"},{"key":"29_CR9","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-319-18167-7_19","volume-title":"Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences","author":"B Crawford","year":"2015","unstructured":"Crawford, B., Soto, R., Palma, W., Paredes, F., Johnson, F., Norero, E.: The impact of a new formulation when solving the set covering problem using the ACO metaheuristic. Model. Comput. & Optim. in Inf. Syst. & Manage. Sci. AISC, vol. 360, pp. 209\u2013218. Springer, Heidelberg (2015)"},{"key":"29_CR10","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, Part II. LNCS, vol. 9012, pp. 41\u201350. Springer, Heidelberg (2015)"},{"key":"29_CR11","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/978-3-319-18473-9_31","volume-title":"Software Engineering in Intelligent Systems - Proceedings of the 4th Computer Science On-line Conference 2015","author":"B Crawford","year":"2015","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, K.Z., Prokopova, Z., Silhavy, P. (eds.) Software Engineering in Intelligent Systems. AISC, vol. 349, pp. 317\u2013326. Springer, Heidelberg (2015)"},{"key":"29_CR12","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, Part IV. LNCS, vol. 9158, pp. 431\u2013443. Springer, Heidelberg (2015)"},{"key":"29_CR13","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 - Proceedings of the 4th Computer Science On-line Conference 2015 (CSOC2015): 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. Software Engineering in Intelligent Systems. AISC, vol. 349, pp. 307\u2013315. Springer, Heidelberg (2015)"},{"key":"29_CR14","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":"29_CR15","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":"29_CR16","first-page":"7","volume":"4","author":"N Moosavian","year":"2014","unstructured":"Moosavian, N.: Soccer league competition algorithm, a new method for solving systems of nonlinear equations. Sci. Res. 4, 7\u201316 (2014)","journal-title":"Sci. Res."},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.swevo.2014.10.002","volume":"20","author":"N Moosavian","year":"2015","unstructured":"Moosavian, N.: Soccer league competition algorithm for solving knapsack problems. Swarm Evol. Comput. 20, 14\u201322 (2015)","journal-title":"Swarm Evol. Comput."},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.swevo.2014.02.002","volume":"17","author":"N Moosavian","year":"2014","unstructured":"Moosavian, N., Roodsari, B.K.: Soccer league competition algorithm: a novel meta-heuristic algorithm for optimal design of water distribution networks. Swarm Evol. Comput. 17, 14\u201324 (2014)","journal-title":"Swarm Evol. Comput."},{"key":"29_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-319-18833-1_10","volume-title":"Bioinspired Computation in Artificial Systems","author":"R Soto","year":"2015","unstructured":"Soto, R., Crawford, B., Olivares, R., Barraza, J., Johnson, F., Paredes, F.: A binary cuckoo search algorithm for solving the set covering problem. In: Vicente, J.M.F., \u00c1lvarez-S\u00e1nchez, J.R., L\u00f3pez, F.P., Toledo-Moreo, F.J., Adeli, H. (eds.) IWINAC 2015, Part II. LNCS, vol. 9108, pp. 88\u201397. Springer, Heidelberg (2015)"},{"key":"29_CR20","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/978-3-319-18476-0_11","volume-title":"Artificial Intelligence Perspectives and Applications","author":"R Soto","year":"2015","unstructured":"Soto, R., Crawford, B., Vilches, J., Johnson, F., Paredes, F.: Heuristic feasibility and preprocessing for a set covering solver based on firefly optimization. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Prokopova, Z., Silhavy, P. (eds.) Artificial Intelligence Perspectives and Applications. AISC, vol. 347, pp. 99\u2013108. Springer, Heidelberg (2015)"},{"key":"29_CR21","unstructured":"Yang, Q., McPeek, J., Nofsinger, A.: Efficient and effective practical algorithms for the set-covering problem. In: Proceedings of the 2008 International Conference on Scientific Computing, CSC, 14\u201317 July 2008, Las Vegas, Nevada, USA. pp. 156\u2013159 (2008)"}],"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_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:59:32Z","timestamp":1558313972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42085-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319420844","9783319420851"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42085-1_29","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"}}]}}