{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:10:02Z","timestamp":1748459402040,"version":"3.41.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181660"},{"type":"electronic","value":"9783319181677"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18167-7_19","type":"book-chapter","created":{"date-parts":[[2015,5,7]],"date-time":"2015-05-07T04:27:19Z","timestamp":1430972839000},"page":"209-218","source":"Crossref","is-referenced-by-count":0,"title":["The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenceslao","family":"Palma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Paredes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franklin","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrique","family":"Norero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Balachandar, S.R., Kannan, K.: A meta-heuristic algorithm for set covering problem based on gravity\u00a04(7), 944\u2013950 (2010)"},{"issue":"6","key":"19_CR2","doi-asserted-by":"publisher","first-page":"875","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. Operations Research\u00a044(6), 875\u2013890 (1996)","journal-title":"Operations Research"},{"issue":"11","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E.: Or-library: distributing test problems by electronic mail. Journal of the Operational Research Society\u00a041(11), 1069\u20131072 (1990)","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"J. Beasley","year":"1996","unstructured":"Beasley, J., Chu, P.: A genetic algorithm for the set covering problem. European Journal of Operational Research\u00a094(2), 392\u2013404 (1996)","journal-title":"European Journal of Operational Research"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1023\/A:1018900128545","volume":"86","author":"M. Brusco","year":"1999","unstructured":"Brusco, M., Jacobs, L., Thompson, G.: A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems. Annals of Operations Research\u00a086, 611\u2013627 (1999)","journal-title":"Annals of Operations Research"},{"issue":"5","key":"19_CR6","doi-asserted-by":"publisher","first-page":"730","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. Operations Research\u00a047(5), 730\u2013743 (1999)","journal-title":"Operations Research"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Caserta, M.: Tabu search-based metaheuristic algorithm for large-scale set covering problems. In: Doerner, K., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R., Reimann, M. (eds.) Metaheuristics, Operations Research\/Computer Science Interfaces Series, vol.\u00a039, pp. 43\u201363. Springer US (2007)","DOI":"10.1007\/978-0-387-71921-4_3"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01581106","volume":"81","author":"S. Ceria","year":"1998","unstructured":"Ceria, S., Nobili, P., Sassano, A.: A lagrangian-based heuristic for large-scale set covering problems. Mathematical Programming\u00a081(2), 215\u2013228 (1998)","journal-title":"Mathematical Programming"},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"233","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. Mathematics of Operations Research\u00a04(3), 233\u2013235 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Monfroy, E., Castro, C., Palma, W., Paredes, F.: A hybrid soft computing approach for subset problems. Mathematical Problems in Engineering, Article ID 716069, 1\u201312 (2013)","DOI":"10.1155\/2013\/716069"},{"key":"19_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1007\/11785231_113","volume-title":"Artificial Intelligence and Soft Computing \u2013 ICAISC 2006","author":"B. Crawford","year":"2006","unstructured":"Crawford, B., Castro, C.: Integrating lookahead and post processing procedures with ACO for solving set partitioning and covering problems. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., \u017burada, J.M. (eds.) ICAISC 2006. LNCS (LNAI), vol.\u00a04029, pp. 1082\u20131090. Springer, Heidelberg (2006)"},{"key":"19_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/11925231_36","volume-title":"MICAI 2006: Advances in Artificial Intelligence","author":"B. Crawford","year":"2006","unstructured":"Crawford, B., Castro, C., Monfroy, E.: A hybrid ant algorithm for the airline crew pairing problem. In: Gelbukh, A., Reyes-Garcia, C.A. (eds.) MICAI 2006. LNCS (LNAI), vol.\u00a04293, pp. 381\u2013391. Springer, Heidelberg (2006)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Crawford, B., Lagos, C., Castro, C., Paredes, F.: A evolutionary approach to solve set covering. In: ICEIS (2), pp. 356\u2013363 (2007)","DOI":"10.5220\/0002406703560360"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Monfroy, E.: Cultural algorithms for the set covering problem. In: ICSI (2), pp. 27\u201334 (2013)","DOI":"10.1007\/978-3-642-38715-9_4"},{"issue":"1","key":"19_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation\u00a01(1), 53\u201366 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, USA (2004)","DOI":"10.7551\/mitpress\/1290.001.0001"},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B\u00a026(1), 29\u201341 (1996)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B"},{"issue":"6","key":"19_CR18","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"M.L. Fisher","year":"1990","unstructured":"Fisher, M.L., Kedia, P.: Optimal solution of set covering\/partitioning problems using dual heuristics. Management Science\u00a036(6), 674\u2013688 (1990)","journal-title":"Management Science"},{"key":"19_CR19","unstructured":"Hadji, R., Rahoual, M., Talbi, E., Bachelet, V.: Ant colonies for the set covering problem. In: Dorigo, M., et al. (eds.) ANTS 2000, pp. 63\u201366 (2000)"},{"key":"19_CR20","unstructured":"Leguizam\u00f3n, G., Michalewicz, Z.: A new version of ant system for subset problems. In: Angeline, P., Michalewicz, Z., Schoenauer, M., Yao, X., Zalzala, A. (eds.) Proceedings of Congress on Evolutionary Computation (CEC 1999), July 6-9. IEEE Press, Washington, DC (1999)"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-28646-2_1","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"L. Lessing","year":"2004","unstructured":"Lessing, L., Dumitrescu, I., St\u00fctzle, T.: A comparison between ACO algorithms for the set covering problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., St\u00fctzle, T. (eds.) ANTS 2004. LNCS, vol.\u00a03172, pp. 1\u201312. Springer, Heidelberg (2004)"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Mesquita, M., Paias, A.: Set partitioning\/covering-based approaches for the integrated vehicle and crew scheduling problem. Computers and Operations Research\u00a035(5), 1562\u20131575 (2008), part Special Issue: Algorithms and Computational Methods in Feasibility and Infeasibility","DOI":"10.1016\/j.cor.2006.09.001"},{"issue":"4","key":"19_CR23","doi-asserted-by":"publisher","first-page":"4618","DOI":"10.1016\/j.eswa.2011.09.076","volume":"39","author":"B.C. Mohan","year":"2012","unstructured":"Mohan, B.C., Baskaran, R.: A survey: Ant colony optimization based recent research and implementation on several engineering domain. Expert Systems with Applications\u00a039(4), 4618\u20134627 (2012)","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"19_CR24","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.ejor.2010.01.035","volume":"205","author":"Z. Naji-Azimi","year":"2010","unstructured":"Naji-Azimi, Z., Toth, P., Galli, L.: An electromagnetism metaheuristic for the unicost set covering problem. European Journal of Operational Research\u00a0205(2), 290\u2013300 (2010)","journal-title":"European Journal of Operational Research"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Nehme, B., Galinier, P., Guibault, F.: A new formulation of the set covering problem for metaheuristic approaches. ISRN Operations Research, Article ID 203032, 1\u201310 (2013)","DOI":"10.1155\/2013\/203032"},{"issue":"4","key":"19_CR26","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.cie.2010.02.011","volume":"58","author":"Z.G. Ren","year":"2010","unstructured":"Ren, Z.G., Feng, Z.R., Ke, L.J., Zhang, Z.J.: New ideas for applying ant colony optimization to the set covering problem. Computers and Industrial Engineering\u00a058(4), 774\u2013784 (2010)","journal-title":"Computers and Industrial Engineering"},{"issue":"3","key":"19_CR27","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/opre.35.3.346","volume":"35","author":"F.J. Vasko","year":"1987","unstructured":"Vasko, F.J., Wolf, F.E., Stott, K.L.: Optimal selection of ingot sizes via set covering. Operations Research\u00a035(3), 346\u2013353 (1987)","journal-title":"Operations Research"},{"issue":"2","key":"19_CR28","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0167-6377(84)90047-6","volume":"3","author":"F.J. Vasko","year":"1984","unstructured":"Vasko, F.J., Wilson, G.R.: Using a facility location algorithm to solve large set covering problems. Operations Research Letters\u00a03(2), 85\u201390 (1984)","journal-title":"Operations Research Letters"}],"container-title":["Advances in Intelligent Systems and Computing","Modelling, Computation and Optimization in Information Systems and Management Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18167-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T20:50:46Z","timestamp":1748379046000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18167-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181660","9783319181677"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18167-7_19","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}