{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:59:14Z","timestamp":1743137954111,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319067391"},{"type":"electronic","value":"9783319067407"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","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":[[2014]]},"DOI":"10.1007\/978-3-319-06740-7_5","type":"book-chapter","created":{"date-parts":[[2014,5,5]],"date-time":"2014-05-05T21:11:06Z","timestamp":1399324266000},"page":"53-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["An Artificial Bee Colony Algorithm for the Set Covering Problem"],"prefix":"10.1007","author":[{"given":"Rodrigo","family":"Cuesta","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":"Fernando","family":"Paredes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,6]]},"reference":[{"issue":"6","key":"5_CR1","doi-asserted-by":"publisher","first-page":"875890","DOI":"10.1287\/opre.44.6.875","volume":"44","author":"E Balas","year":"1996","unstructured":"Balas, E., Carrera, M.C.: A dynamic subgradient-based branch-and-bound procedure for set covering. Oper. Res. 44(6), 875890 (1996)","journal-title":"Oper. Res."},{"issue":"6","key":"5_CR2","doi-asserted-by":"publisher","first-page":"674688","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"ML Fisher","year":"1990","unstructured":"Fisher, M.L., Kedia, P.: Optimal solution of set covering\/partitioning problems using dual heuristics. Manage. Sci. 36(6), 674688 (1990)","journal-title":"Manage. Sci."},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"233235","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233235 (1979)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"362374","DOI":"10.1016\/j.cie.2006.08.002","volume":"51","author":"G Lan","year":"2006","unstructured":"Lan, G., DePuy, G.W.: On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the set covering problem. Comput. Ind. Eng. 51(3), 362374 (2006)","journal-title":"Comput. Ind. Eng."},{"key":"5_CR5","first-page":"215228","volume":"81","author":"S Ceria","year":"1998","unstructured":"Ceria, S., Nobili, P., Sassano, A.: A Lagrangian-based heuristic for large-scale set covering problems. Math. Program. 81, 215228 (1998)","journal-title":"Math. Program."},{"issue":"5","key":"5_CR6","doi-asserted-by":"publisher","first-page":"730743","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A Caprara","year":"1999","unstructured":"Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Oper. Res. 47(5), 730743 (1999)","journal-title":"Oper. Res."},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"392404","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"JE Beasley","year":"1996","unstructured":"Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 94(2), 392404 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"611627","DOI":"10.1023\/A:1018900128545","volume":"86","author":"MJ Brusco","year":"1999","unstructured":"Brusco, M.J., Jacobs, L.W., Thompson, G.M.: A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems. Ann. Oper. Res. 86, 611627 (1999)","journal-title":"Ann. Oper. Res."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-0-387-71921-4_3","volume-title":"Metaheuristics: Progress in Complex Systems Optimization","author":"M Caserta","year":"2007","unstructured":"Caserta, M.: Tabu search-based metaheuristic algorithm for large-scale set covering problems. In: Doerner, K.F., et al. (eds.) Metaheuristics: Progress in Complex Systems Optimization, pp. 43\u201363. Springer, New York (2007)"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"353371","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A Caprara","year":"2000","unstructured":"Caprara, A., Toth, P., Fischetti, M.: Algorithms for the set covering problem. Ann. Oper. Res. 98, 353371 (2000)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0377-2217(92)90215-U","volume":"58","author":"JE Beasley","year":"1992","unstructured":"Beasley, J.E., Jornsten, K.: Enhancing an algorithm for set covering problems. Eur. J. Oper. Res. 58(2), 293\u2013300 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR12","first-page":"2000","volume":"98","author":"A Caprara","year":"1998","unstructured":"Caprara, A., Fischetti, M., Toth, P.: Algorithms for the set covering problem. Ann. Oper. Res. 98, 2000 (1998)","journal-title":"Ann. Oper. Res."},{"key":"5_CR13","unstructured":"Aickelin, U.: An indirect genetic algorithm for set covering problems, CoRR,0803.2965 (2008)"},{"key":"5_CR14","first-page":"27","volume":"2","author":"B Crawford","year":"2013","unstructured":"Crawford, B., Soto, R., Monfroy, E.: Cultural algorithms for the set covering problem. ICSI 2, 27\u201334 (2013)","journal-title":"ICSI"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Crawford, B., Castro, C., Monfroy, E.: A new ACO transition rule for set partitioning and covering problems, pp. 426\u2013429. In: SoCPaR 2009 (2009)","DOI":"10.1109\/SoCPaR.2009.89"},{"issue":"2007","key":"5_CR16","first-page":"356","volume":"2","author":"B Crawford","year":"2007","unstructured":"Crawford, B., Lagos, C., Castro, C., Paredes, F.: A evolutionary approach to solve set covering. ICEIS 2(2007), 356\u2013363 (2007)","journal-title":"ICEIS"},{"issue":"3","key":"5_CR17","doi-asserted-by":"publisher","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. Global Optim. 39(3), 459\u2013471 (2007)","journal-title":"J. Global Optim."},{"key":"5_CR18","unstructured":"Karaboga, D.: An idea based on honey bee swarm for numerical optimization, Technical Report TR06. Computer Engineering Department, Erciyes University, Turkey (2005)"},{"issue":"2","key":"5_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)","journal-title":"Appl. Soft Comput."},{"key":"5_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/b101874","volume-title":"Handbook of Metaheuristics","author":"F Glover","year":"2003","unstructured":"Glover, F., Kochenberger, G.A.: Handbook of Metaheuristics. Springer, Berlin (2003)"},{"issue":"5","key":"5_CR21","doi-asserted-by":"publisher","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-function based hyperheuristic using particle swarm optimization. Expert Syst. Appl. 40(5), 1690 (2013)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"5_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/0952813X.2012.656328","volume":"25","author":"E Monfroy","year":"2013","unstructured":"Monfroy, E., Castro, C., Crawford, B., Soto, R., Paredes, F., Figueroa, C.: A reactive and hybrid constraint solver. J. Exp. Theor. Artif. Intell. 25(1), 1\u201322 (2013)","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"5_CR23","first-page":"175","volume-title":"A Hyperheuristic Approach for Guiding Enumeration in Constraint Solving Advances in Intelligent Systems and Computing","author":"B Crawford","year":"2012","unstructured":"Crawford, B., Castro, C., Monfroy, E., Soto, R., Palma, W., Paredes, F.: A Hyperheuristic Approach for Guiding Enumeration in Constraint Solving Advances in Intelligent Systems and Computing, p. 175. Springer, Berlin (2012)"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Soto, R., Crawford, B., Monfroy, E., Bustos, V.: Using autonomous search for generating good enumeration strategy blends in constraint programming. In: Proceedings of the 12th International Conference on Computational Science and Its Applications (ICCSA), p 7335 (2012)","DOI":"10.1007\/978-3-642-31137-6_46"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Castro, C., Monfroy, E.: A hyperheuristic approach for dynamic enumeration strategy selection in constraint satisfaction. In: Proceedings of the 4th International Work-conference on the Interplay Between Natural and Artificial Computation (IWINAC), p. 668 (2011)","DOI":"10.1007\/978-3-642-21326-7_32"}],"container-title":["Advances in Intelligent Systems and Computing","Modern Trends and Techniques in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06740-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T15:59:41Z","timestamp":1676390381000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-06740-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319067391","9783319067407"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06740-7_5","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"6 May 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}