{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T17:14:20Z","timestamp":1780334060610,"version":"3.54.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030219017","type":"print"},{"value":"9783030219024","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-21902-4_4","type":"book-chapter","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T23:04:01Z","timestamp":1562713441000},"page":"43-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Using a Social Media Inspired Optimization Algorithm to Solve the Set Covering Problem"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guillermo","family":"Cabrera","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Agust\u00edn","family":"Salas-Fern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fernando","family":"Paredes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"E Talbi","year":"2009","unstructured":"Talbi, E.: Metaheuristics: From Design to Implementation, vol. 74. Wiley, Hoboken (2009)"},{"issue":"1","key":"4_CR2","first-page":"1","volume":"5","author":"Z Beheshti","year":"2013","unstructured":"Beheshti, Z., Shamsuddin, S.: A review of population-based meta-heuristic algorithms. Int. J. Adv. Soft Comput. Appl. 5(1), 1\u201335 (2013)","journal-title":"Int. J. Adv. Soft Comput. Appl."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-1-4615-1507-4_15","volume-title":"Operations Research\/Computer Science Interfaces Series","author":"Paola Festa","year":"2002","unstructured":"Festa, P., Resende, M.: GRASP: an annotated bibliography. In: Essays and Surveys in Metaheuristics. ORCS, vol. 15, pp. 325\u2013367. Springer, Boston (2002). https:\/\/doi.org\/10.1007\/978-1-4615-1507-4_15"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87527-7","volume-title":"Ant Colony Optimization and Swarm Intelligence","year":"2008","unstructured":"Dorigo, M., Birattari, M., Blum, C., Clerc, M., St\u00fctzle, T., Winfield, A.F.T. (eds.): Ant Colony Optimization and Swarm Intelligence. LNCS, vol. 5217. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87527-7"},{"issue":"1\u20132","key":"4_CR5","first-page":"71","volume":"1","author":"H Shah","year":"2009","unstructured":"Shah, H.: The intelligent water drops algorithm: a nature-inspired swarm-based optimization algorithm. Int. J. Bio-Inspired Comput. 1(1\u20132), 71\u201379 (2009)","journal-title":"Int. J. Bio-Inspired Comput."},{"issue":"3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1109\/5326.704576","volume":"28","author":"H Ishibuchi","year":"1998","unstructured":"Ishibuchi, H., Murata, T.: A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans. Syst. Man Cybern. Part C (Appl. Rev.) 28(3), 392\u2013403 (1998)","journal-title":"IEEE Trans. Syst. Man Cybern. Part C (Appl. Rev.)"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","volume":"91","author":"E Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flow-shop problem. Eur. J. Oper. Res. 91(1), 160\u2013175 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-94-015-7744-1_2","volume-title":"Simulated Annealing: Theory and Applications","author":"Peter J. M. van Laarhoven","year":"1987","unstructured":"van Laarhoven, P.J.M., Aarts, E.H.L.: Simulated annealing. In: Simulated Annealing: Theory and Applications. MAIA, vol. 37, pp. 7\u201315, Springer, Dordrecht (1987). https:\/\/doi.org\/10.1007\/978-94-015-7744-1_2"},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00175354","volume":"4","author":"D Whitley","year":"1994","unstructured":"Whitley, D.: A genetic algorithm tutorial. Stat. Comput. 4(2), 65\u201385 (1994)","journal-title":"Stat. Comput."},{"key":"4_CR10","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/0-306-48056-5_1","volume-title":"Handbook of Metaheuristics","author":"F Glover","year":"2003","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Scatter search and path relinking: advances and applications. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. ISOR, vol. 57, pp. 1\u201335. Springer, Boston (2003). https:\/\/doi.org\/10.1007\/0-306-48056-5_1"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1007\/978-0-387-30164-8","volume-title":"Encyclopedia of Machine Learning","author":"J Kennedy","year":"2011","unstructured":"Kennedy, J.: Particle swarm optimization. In: Sammut, C., Webb, G.I. (eds.) Encyclopedia of Machine Learning, pp. 760\u2013766. Springer, Boston (2011). https:\/\/doi.org\/10.1007\/978-0-387-30164-8"},{"key":"4_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50920-4","volume-title":"Nature-Inspired Computing and Optimization","author":"S Patnaik","year":"2017","unstructured":"Patnaik, S., Yang, X.-S., Nakamatsu, K.: Nature-Inspired Computing and Optimization, vol. 10. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-50920-4"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-319-46675-0_38","volume-title":"Neural Information Processing","author":"Z Lv","year":"2016","unstructured":"Lv, Z., Shen, F., Zhao, J., Zhu, T.: A swarm intelligence algorithm inspired by Twitter. In: Hirose, A., Ozawa, S., Doya, K., Ikeda, K., Lee, M., Liu, D. (eds.) ICONIP 2016. LNCS, vol. 9949, pp. 344\u2013351. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46675-0_38"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"8404231:1","DOI":"10.1155\/2017\/8404231","volume":"2017","author":"B Crawford","year":"2017","unstructured":"Crawford, B., Soto, R., Astorga, G., Garc\u00eda, J., Castro, C., Paredes, F.: Putting continuous metaheuristics to work in binary search spaces. Complexity 2017, 8404231:1\u20138404231:19 (2017)","journal-title":"Complexity"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-68279-0_8","volume-title":"50 Years of Integer Programming 1958\u20132008 - From the Early Years to the State-of-the-Art","author":"R Karp","year":"2010","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: J\u00fcnger, M., et al. (eds.) 50 Years of Integer Programming 1958\u20132008 - From the Early Years to the State-of-the-Art, pp. 219\u2013241. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_8"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/3-540-45561-2_36","volume-title":"Real-World Applications of Evolutionary Computing","author":"E Marchiori","year":"2000","unstructured":"Marchiori, E., Steenbeek, A.: An evolutionary algorithm for large scale set covering problems with application to airline crew scheduling. In: Cagnoni, S. (ed.) EvoWorkshops 2000. LNCS, vol. 1803, pp. 370\u2013384. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45561-2_36"},{"issue":"5","key":"4_CR17","doi-asserted-by":"publisher","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"},{"issue":"1","key":"4_CR18","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.cie.2011.08.020","volume":"62","author":"RZ Farahani","year":"2012","unstructured":"Farahani, R.Z., Asgari, N., Heidari, N., Hosseininia, M., Goh, M.: Covering problems in facility location: a review. Comput. Ind. Eng. 62(1), 368\u2013407 (2012)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1287\/trsc.15.2.137","volume":"15","author":"MS Daskin","year":"1981","unstructured":"Daskin, M.S., Stern, E.H.: A hierarchical objective set covering model for emergency medical service vehicle deployment. Transp. Sci. 15(2), 137\u2013152 (1981)","journal-title":"Transp. Sci."},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Intanagonwiwat, C., Estrin, D., Govindan, R., Heidemann, J.: Impact of network density on data aggregation in wireless sensor networks. In: Proceedings 22nd International Conference on Distributed Computing Systems, pp. 457\u2013458, July 2002. https:\/\/doi.org\/10.1109\/ICDCS.2002.1022289. ISSN: 1063-6927","DOI":"10.1109\/ICDCS.2002.1022289"},{"issue":"2","key":"4_CR21","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."},{"issue":"1","key":"4_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"ML Fisher","year":"1981","unstructured":"Fisher, M.L.: The Lagrangian relaxation method for solving integer programming problems. Manag. Sci. 27(1), 1\u201318 (1981)","journal-title":"Manag. Sci."},{"issue":"1","key":"4_CR23","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. Eur. J. Oper. Res. 31(1), 85\u201393 (1987)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"4_CR24","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1287\/opre.17.5.848","volume":"17","author":"RS Garfinkel","year":"1969","unstructured":"Garfinkel, R.S., Nemhauser, G.L.: The set-partitioning problem: set covering with equality constraints. Oper. Res. 17(5), 848\u2013856 (1969)","journal-title":"Oper. Res."},{"issue":"3","key":"4_CR25","doi-asserted-by":"publisher","first-page":"20","DOI":"10.18004\/ucsa\/2409-8752\/2017.004(03)020-033","volume":"4","author":"J Salas","year":"2017","unstructured":"Salas, J., Mora, M., Barriga, H., Rubio, J., Broderick, C.: Study of population variation using harmony search for the resolution of set covering problem. Revista Cient\u00edfica de la UCSA 4(3), 20\u201333 (2017)","journal-title":"Revista Cient\u00edfica de la UCSA"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1007\/978-3-319-42007-3_74","volume-title":"Trends in Applied Knowledge-Based Systems and Data Science","author":"\u00c1G Rubio","year":"2016","unstructured":"Rubio, \u00c1.G., et al.: An binary black hole algorithm to solve set covering problem. In: Fujita, H., Ali, M., Selamat, A., Sasaki, J., Kurematsu, M. (eds.) IEA\/AIE 2016. LNCS, vol. 9799, pp. 873\u2013883. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42007-3_74"}],"container-title":["Lecture Notes in Computer Science","Social Computing and Social Media. Design, Human Behavior and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21902-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T00:26:14Z","timestamp":1689726374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21902-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030219017","9783030219024"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21902-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"8 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HCII","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Human-Computer Interaction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Orlando, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hcii2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.hci.international\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}