{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T20:05:56Z","timestamp":1749672356544,"version":"3.37.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319669625"},{"type":"electronic","value":"9783319669632"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-66963-2_50","type":"book-chapter","created":{"date-parts":[[2017,8,28]],"date-time":"2017-08-28T07:15:18Z","timestamp":1503904518000},"page":"565-578","source":"Crossref","is-referenced-by-count":31,"title":["A Meta-Optimization Approach for Covering Problems in Facility Location"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Monfroy","sequence":"additional","affiliation":[]},{"given":"Gino","family":"Astorga","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9","family":"Garc\u00eda","sequence":"additional","affiliation":[]},{"given":"Enrique","family":"Cortes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,29]]},"reference":[{"issue":"3","key":"50_CR1","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s11047-015-9509-2","volume":"15","author":"S Balaji","year":"2016","unstructured":"Balaji, S., Revathi, N.: A new approach for solving set covering problem using jumping particle swarm optimization method. Nat. Comput. 15(3), 503\u2013517 (2016)","journal-title":"Nat. Comput."},{"issue":"189164","key":"50_CR2","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(189164), 1\u20138 (2014)","journal-title":"Sci. World J."},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Surez, M.O., Paredes, F., Johnson, F.: Binary firefly algorithm for the set covering problem. In: 2014 9th Iberian Conference on Information Systems and Technologies (CISTI), pp. 1\u20135, June 2014","DOI":"10.1109\/CISTI.2014.6877090"},{"key":"50_CR4","doi-asserted-by":"crossref","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 (2017). Pages 19","DOI":"10.1155\/2017\/8404231"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Berr\u00edos, 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 (2015)","DOI":"10.1109\/CISTI.2015.7170365"},{"key":"50_CR6","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","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. AISC, vol. 285, pp. 65\u201373. Springer, Cham (2014). doi: 10.1007\/978-3-319-06740-7_6"},{"key":"50_CR7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-319-11857-4_22","volume-title":"Advances in Swarm Intelligence","author":"B Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., Palma, W., Johnson, F., Paredes, F., Olgu\u00edn, E.: A 2-level approach for the set covering problem: parameter tuning of artificial bee colony algorithm by using genetic algorithm. In: Tan, Y., Shi, Y., Coello, C. (eds.) Advances in Swarm Intelligence, vol. 8794, pp. 189\u2013196. Springer, Cham (2014)"},{"key":"50_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-15705-4_5","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 (LNAI), vol. 9012, pp. 41\u201350. Springer, Cham (2015). doi: 10.1007\/978-3-319-15705-4_5"},{"issue":"12","key":"50_CR9","doi-asserted-by":"crossref","first-page":"3556","DOI":"10.1166\/asl.2013.5236","volume":"19","author":"B Crawford","year":"2013","unstructured":"Crawford, B., Valenzuela, C., Soto, R., Monfroy, E., Paredes, F.: Parameter tuning of metaheuristics using metaheuristics. Adv. Sci. Lett. 19(12), 3556\u20133559 (2013)","journal-title":"Adv. Sci. Lett."},{"key":"50_CR10","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-319-06740-7_5","volume-title":"Modern Trends and Techniques in Computer Science","author":"R Cuesta","year":"2014","unstructured":"Cuesta, R., Crawford, B., Soto, R., Paredes, F.: An artificial bee colony 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. AISC, vol. 285, pp. 53\u201363. Springer, Cham (2014). doi: 10.1007\/978-3-319-06740-7_5"},{"issue":"4","key":"50_CR11","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1002\/nav.20410","volume":"57","author":"T Drezner","year":"2010","unstructured":"Drezner, T., Drezner, Z., Goldstein, Z.: A stochastic gradual cover location problem. Nav. Res. Logist. (NRL) 57(4), 367\u2013372 (2010). doi: 10.1002\/nav.20410","journal-title":"Nav. Res. Logist. (NRL)"},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"Garc\u00eda, J., Crawford, B., Soto, R., Carlos, C., Paredes, F.: A k-means binarization framework applied to multidimensional knapsack problem. Appl. Intell. 1\u201324 (2017)","DOI":"10.1007\/s10489-017-0972-6"},{"key":"50_CR13","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/978-981-10-3728-3_6","volume-title":"Harmony Search Algorithm","author":"J Garc\u00eda","year":"2017","unstructured":"Garc\u00eda, J., Crawford, B., Soto, R., Garc\u00eda, P.: A multi dynamic binary black hole algorithm applied to set covering problem. In: Del Ser, J. (ed.) Harmony Search Algorithm, pp. 42\u201351. Springer, Singapore (2017)"},{"key":"50_CR14","unstructured":"Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical report-tr06, Erciyes University, Engineering faculty, Computer Engineering Department (2005)"},{"issue":"3","key":"50_CR15","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."},{"issue":"3","key":"50_CR16","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"Karaboga, D., Gorkemli, B., Ozturk, C., Karaboga, N.: A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif. Intell. Rev. 42(3), 21\u201357 (2014)","journal-title":"Artif. Intell. Rev."},{"issue":"4","key":"50_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4018\/IJAMC.2015100101","volume":"6","author":"Y Lu","year":"2015","unstructured":"Lu, Y., Vasko, F.J.: An or practitioner\u2019s solution approach for the set covering problem. Int. J. Appl. Metaheuristic Comput. (IJAMC) 6(4), 1\u201313 (2015)","journal-title":"Int. J. Appl. Metaheuristic Comput. (IJAMC)"},{"issue":"1","key":"50_CR18","first-page":"25","volume":"1","author":"DA Schilling","year":"1993","unstructured":"Schilling, D.A., Jayaraman, V., Barkhi, R.: A review of covering problem in facility location. Locat. Sci. 1(1), 25\u201355 (1993)","journal-title":"Locat. Sci."},{"issue":"2","key":"50_CR19","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1016\/j.asoc.2008.09.001","volume":"9","author":"A Singh","year":"2009","unstructured":"Singh, A.: An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl. Soft Comput. 9(2), 625\u2013631 (2009). doi: 10.1016\/j.asoc.2008.09.001","journal-title":"Appl. Soft Comput."},{"key":"50_CR20","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-18476-0_10","volume-title":"Artificial Intelligence Perspectives and Applications","author":"R Soto","year":"2015","unstructured":"Soto, R., Crawford, B., Mu\u00f1oz, A., Johnson, F., Paredes, F.: Pre-processing, repairing and transfer functions can help binary electromagnetism-like algorithms. In: Silhavy, R., Senkerik, R., Oplatkova, Z., Prokopova, Z., Silhavy, P. (eds.) Artificial Intelligence Perspectives and Applications. Advances in Intelligent Systems and Computing, vol. 347, pp. 89\u201397. Springer, Cham (2015). doi: 10.1007\/978-3-319-18476-0_10"},{"key":"50_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11047-016-9594-x","volume":"16","author":"R Soto","year":"2017","unstructured":"Soto, R., Crawford, B., Olivares, R., Barraza, J., Figueroa, I., Johnson, F., Paredes, F., Olgu\u00edn, E.: Solving the non-unicost set covering problem by using cuckoo search and black hole optimization. Nat. Comput. 16, 1\u201317 (2017)","journal-title":"Nat. Comput."},{"issue":"6","key":"50_CR22","doi-asserted-by":"publisher","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). doi: 10.1287\/opre.19.6.1363","journal-title":"Oper. Res."}],"container-title":["Communications in Computer and Information Science","Applied Computer Sciences in Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66963-2_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T17:15:33Z","timestamp":1570036533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66963-2_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319669625","9783319669632"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66963-2_50","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}