{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:06:38Z","timestamp":1743123998075,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"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_16","type":"book-chapter","created":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T02:50:27Z","timestamp":1467341427000},"page":"207-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Solving the Set Covering Problem with a Binary Black Hole Inspired Algorithm"],"prefix":"10.1007","author":[{"given":"\u00c1lvaro G\u00f3mez","family":"Rubio","sequence":"first","affiliation":[]},{"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[]},{"given":"Eduardo","family":"Olgu\u00edn","sequence":"additional","affiliation":[]},{"given":"Sanjay","family":"Misra","sequence":"additional","affiliation":[]},{"given":"Adri\u00e1n","family":"Jaramillo","sequence":"additional","affiliation":[]},{"given":"Sebasti\u00e1n Mansilla","family":"Villablanca","sequence":"additional","affiliation":[]},{"given":"Juan","family":"Salas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/opre.35.3.346","volume":"35","author":"F Vasko","year":"1987","unstructured":"Vasko, F., Wolf, F., Stott, K.: Optimal selection of ingot sizes via set covering. Oper. Res. 35(3), 346\u2013353 (1987)","journal-title":"Oper. Res."},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.23.1.1","volume":"23","author":"M Desrochers","year":"1989","unstructured":"Desrochers, M., Soumis, F.: A column generation approach to the urban transit crew scheduling problem. Transp. Sci. 23(1), 1\u201313 (1989)","journal-title":"Transp. Sci."},{"issue":"4\u2013part\u2013i","key":"16_CR3","doi-asserted-by":"publisher","first-page":"B-174","DOI":"10.1287\/mnsc.18.4.B174","volume":"18","author":"M Bellmore","year":"1971","unstructured":"Bellmore, M., Ratliff, H.D.: Optimal defense of multi-commodity networks. Manage. Sci. 18(4\u2013part\u2013i), B-174 (1971)","journal-title":"Manage. Sci."},{"key":"16_CR4","first-page":"267","volume":"347","author":"RS Garfinkel","year":"2015","unstructured":"Garfinkel, R.S., Nemhauser, G.L.: Optimal political districting byimplicit enumeration techniques. Manage. Sci. 347, 267\u2013276 (2015)","journal-title":"Manage. Sci."},{"issue":"5","key":"16_CR5","doi-asserted-by":"publisher","first-page":"2272","DOI":"10.1016\/j.asoc.2013.02.001","volume":"13","author":"F Amini","year":"2013","unstructured":"Amini, F., Ghaderi, P.: Hybridization of harmony search and ant colony optimization for optimal locating of structural dampers. Appl. Soft Comput. 13(5), 2272\u20132280 (2013)","journal-title":"Appl. Soft Comput."},{"unstructured":"Karp, R.: Reducibility among combinatorial problems (1972). \n                      http:\/\/www.cs.berkeley.edu\/~luca\/cs172\/karp.pdf","key":"16_CR6"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ins.2012.08.023","volume":"222","author":"A Hatamlou","year":"2013","unstructured":"Hatamlou, A.: Black hole: a new heuristic optimization approach for data clustering. Inf. Sci. 222, 175\u2013184 (2013)","journal-title":"Inf. Sci."},{"unstructured":"Ataim, P.: Resoluci\u00f3n del problema de set-covering usando un algoritmo gen\u00e9tico (2005)","key":"16_CR8"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1115\/1.4028755","volume":"137","author":"BS Wang","year":"2015","unstructured":"Wang, B.S.: Caro and Crawford, \u201cMulti-objective robust optimization using a postoptimality sensitivity analysis technique: application to a wind turbine design\u201d. J. Mech. Design 137(1), 11 (2015)","journal-title":"J. Mech. Design"},{"key":"16_CR10","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/978-3-319-18476-0_27","volume-title":"Artificial Intelligence Perspectives and Applications","author":"B Crawford","year":"2015","unstructured":"Crawford, B., Soto, R., Johnson, F., Paredes, F.: A timetabling applied case solved with ant colony optimization. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Prokopova, Z., Silhavy, P. (eds.) Artificial Intelligence Perspectives and Applications. AISC, vol. 347, pp. 267\u2013276. Springer, Heidelberg (2015)"},{"unstructured":"Marianov, R.: The queuing probabilistic location set coveringproblem and some extensions. Department of Electrical Engineering, PontificiaUniversidad Cat\u00f3lica de Chile (2002)","key":"16_CR11"},{"issue":"1","key":"16_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1111\/j.1538-4632.1976.tb00529.x","volume":"8","author":"C ReVelle","year":"1976","unstructured":"ReVelle, C., Toregas, C., Falkson, L.: Applications of the location set-covering problem. Geog. Anal. 8(1), 65\u201376 (1976)","journal-title":"Geog. Anal."},{"doi-asserted-by":"crossref","unstructured":"Walker, W.: Using the set-covering problem to assign fire companies to fire houses. The New York City-Rand Institute (1974)","key":"16_CR13","DOI":"10.1287\/opre.22.2.275"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-3-319-09156-3_16","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2014","author":"B Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., Johnson, F., Misra, S., Paredes, F.: The use of metaheuristics to software project scheduling problem. In: Murgante, B., Misra, S., Rocha, A.M.A.C., Torre, C., Rocha, J.G., Falc\u00e3o, M.I., Taniar, D., Apduhan, B.O., Gervasi, O. (eds.) ICCSA 2014, Part V. LNCS, vol. 8583, pp. 215\u2013226. Springer, Heidelberg (2014)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-319-21404-7_14","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2015","author":"R Soto","year":"2015","unstructured":"Soto, R., Crawford, B., Galleguillos, C., Barraza, J., Lizama, S., Mu\u00f1oz, A., Vilches, J., Misra, S., Paredes, F.: Comparing cuckoo search, bee colony, firefly optimization, and electromagnetism-like algorithms for solving 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. 9155, pp. 187\u2013202. Springer, Heidelberg (2015)"},{"key":"16_CR16","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)"},{"unstructured":"Hawking, S.: Agujeros negros y peque\u00f1os universos. Planeta (1994)","key":"16_CR17"},{"unstructured":"S. Hawking and M. Jackson, A brief history of time. Dove Audio, 1993","key":"16_CR18"},{"key":"16_CR19","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.) Software Engineering in Intelligent Systems. AISC, vol. 349, pp. 307\u2013315. Springer, Heidelberg (2015)"},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"68","DOI":"10.14419\/jacst.v4i1.4094","volume":"4","author":"M Farahmandian","year":"2015","unstructured":"Farahmandian, M., Hatamlou, A.: Solving optimization problems using black hole algorithm. J. Adv. Comput. Sci. Technol. 4(1), 68\u201374 (2015)","journal-title":"J. Adv. Comput. Sci. Technol."},{"unstructured":"Beasley, J.: Or-library (1990). \n                      http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/scpinfo.html","key":"16_CR21"},{"issue":"1","key":"16_CR22","doi-asserted-by":"publisher","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. Euro. J. Oper. Res. 31(1), 85\u201393 (1987)","journal-title":"Euro. J. Oper. Res."},{"key":"16_CR23","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. 9155. Springer, Heidelberg (2015)"},{"issue":"37","key":"16_CR24","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2","volume":"1","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: A Lagrangian heuristic for set-covering problems. Naval Res. Logistics 1(37), 151\u2013164 (1990)","journal-title":"Naval Res. Logistics"},{"issue":"3","key":"16_CR25","doi-asserted-by":"publisher","first-page":"143","DOI":"10.11591\/ij-ai.v2i3.3226","volume":"2","author":"M Nemati","year":"2013","unstructured":"Nemati, M., Salimi, R., Bazrkar, N.: Black holes algorithm: a swarm algorithm inspired of black holes for optimization problems. IAES Int. J. Artif. Intell. (IJ-AI) 2(3), 143\u2013150 (2013)","journal-title":"IAES Int. J. Artif. Intell. (IJ-AI)"}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:59:18Z","timestamp":1558313958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42085-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319420844","9783319420851"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42085-1_16","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"}}]}}