{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:02:52Z","timestamp":1743105772615,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42085-1_21","type":"book-chapter","created":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T02:50:27Z","timestamp":1467341427000},"page":"273-283","source":"Crossref","is-referenced-by-count":3,"title":["Solving Set Covering Problem with\u00a0Fireworks\u00a0Explosion"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[]},{"given":"Gonzalo","family":"Astudillo","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":"21_CR1","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)"},{"key":"21_CR2","first-page":"139","volume":"5","author":"D Goldberg","year":"1990","unstructured":"Goldberg, D.: Real-coded genetic algorithms, virtual alphabets, and blocking. Complex Syst. 5, 139\u2013167 (1990)","journal-title":"Complex Syst."},{"issue":"5","key":"21_CR3","doi-asserted-by":"crossref","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."},{"issue":"5","key":"21_CR4","doi-asserted-by":"crossref","first-page":"1690","DOI":"10.1016\/j.eswa.2012.09.013","volume":"40","author":"B Crawford","year":"2013","unstructured":"Crawford, B., Soto, R., Monfroy, E., Palma, W., Castro, C., Paredes, F.: Parameter tuning of a choice-a function based hyperheuristic using particle swarm optimization. Expert Syst. Appl. 40(5), 1690\u20131695 (2013)","journal-title":"Expert Syst. Appl."},{"key":"21_CR5","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":"21_CR6","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-3-319-06740-7_6","volume-title":"Modern Trends and Techniques in Computer Science","author":"B Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., Olivares-Su\u00e1rez, M., Paredes, F.: A binary firefly 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. Advances in Intelligent Systems and Computing, vol. 285, pp. 65\u201373. Springer, Heidelberg (2014)"},{"key":"21_CR7","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)"},{"key":"21_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-46353-6","volume-title":"Fireworks Algorithm: A Novel Swarm Intelligence Optimization Method","author":"Y Tan","year":"2015","unstructured":"Tan, Y.: Fireworks Algorithm: A Novel Swarm Intelligence Optimization Method. Springer, Heidelberg (2015)"},{"key":"21_CR9","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."},{"issue":"1","key":"21_CR10","doi-asserted-by":"crossref","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."},{"key":"21_CR11","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":"21_CR12","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, 346\u2013353 (1987)","journal-title":"Oper. Res."},{"issue":"2","key":"21_CR13","doi-asserted-by":"crossref","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."},{"issue":"1","key":"21_CR14","doi-asserted-by":"crossref","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":"21_CR15","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."},{"issue":"2","key":"21_CR16","doi-asserted-by":"crossref","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":"21_CR17","doi-asserted-by":"crossref","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, 166\u2013181 (1970)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"4","key":"21_CR18","doi-asserted-by":"crossref","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."},{"issue":"8","key":"21_CR19","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."},{"issue":"5","key":"21_CR20","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1287\/inte.27.5.68","volume":"27","author":"E Housos","year":"1997","unstructured":"Housos, E., Elmroth, T.: Automatic optimization of subproblems in scheduling airline crews. Interfaces 27(5), 68\u201377 (1997)","journal-title":"Interfaces"},{"key":"21_CR21","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":"21_CR22","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. Naval Res. Logist. 37, 151\u2013164 (1990)","journal-title":"Naval Res. Logist."}],"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-42085-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T13:35:13Z","timestamp":1498311313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42085-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319420844","9783319420851"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42085-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}