{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:37:19Z","timestamp":1725471439182},"reference-count":21,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387346557"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-34749-3_31","type":"book-chapter","created":{"date-parts":[[2006,10,10]],"date-time":"2006-10-10T19:54:54Z","timestamp":1160510094000},"page":"295-301","source":"Crossref","is-referenced-by-count":0,"title":["Ant Colonies using Arc Consistency Techniques for the Set Partitioning Problem"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Castro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"D. Alexandrov and Y. Kochetov. Behavior of the Ant Colony Algorithm for the Set Covering Problem. In Proc. of Symp. Operations Research, pp 255\u2013260. Springer Verlag, 2000.","DOI":"10.1007\/978-3-642-58300-1_38"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"E. Andersson, E. Housos, N. Kohl and D. Wedelin. Crew Pairing Optimization. In Yu G. (ed.) Operations Research in the Airline Industry, Kluwer Academic Publishing, 1998.","DOI":"10.1007\/978-1-4615-5501-8_8"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E. Balas","year":"1976","unstructured":"E. Balas and M. Padberg. Set Partitioning: A Survey. SIAM Review, 18:710\u2013760, 1976.","journal-title":"SIAM Review"},{"issue":"11","key":"31_CR4","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.2307\/2582903","volume":"41","author":"J. E. Beasley","year":"1990","unstructured":"J. E. Beasley. OR-Library:Distributing test problem by electronic mail. Journal of Operational Research Society, 41(11):1069\u20131072, 1990.","journal-title":"Journal of Operational Research Society"},{"issue":"2","key":"31_CR5","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"J. E. Beasley","year":"1996","unstructured":"J. E. Beasley and P. C. Chu. A genetic algorithm for the set covering problem. European Journal of Operational Research, 94(2):392\u2013404, 1996.","journal-title":"European Journal of Operational Research"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1023\/A:1008668508685","volume":"4","author":"P. C. Chu","year":"1998","unstructured":"P. C. Chu and J. E. Beasley. Constraint handling in genetic algorithms: the set partitoning problem. Journal of Heuristics, 4:323\u2013357, 1998.","journal-title":"Journal of Heuristics"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0004-3702(02)00120-0","volume":"136","author":"R. Dechter","year":"2002","unstructured":"R. Dechter and D. Frost. Backjump-based Backtracking for Constraint Satisfaction Problems. Artificial Intelligence, 136:147\u2013188, 2002.","journal-title":"Artificial Intelligence"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M. Dorigo","year":"1999","unstructured":"M. Dorigo, G. Di Caro, and L. M. Gambardella. Ant Algorithms for Discrete Optimization. Artificial Life, 5:137\u2013172, 1999.","journal-title":"Artificial Life"},{"issue":"l","key":"31_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"l","author":"M. Dorigo","year":"1997","unstructured":"M. Dorigo and L. M. Gambardella. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, l(l):53\u201366, 1997.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"31_CR10","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"M. Dorigo and T. Stutzle. Ant Colony Optimization. MIT Press, USA, 2004."},{"key":"31_CR11","first-page":"67","volume":"8","author":"A. Feo","year":"1989","unstructured":"A. Feo, G. Mauricio, and A. Resende. A Probabilistic Heuristic for a Computationally Difficult Set Covering Problem. OR Letters, 8:67\u201371, 1989.","journal-title":"OR Letters"},{"key":"31_CR12","unstructured":"F. Focacci, F. Laburthe and A. Lodi. Local Search and Constraint Programming. Handbook of metaheuristics, Kluwer, 2002."},{"key":"31_CR13","unstructured":"C. Gagne, M. Gravel and W.L. Price. A Look-Ahead Addition to the Ant Colony Optimization Metaheuristic and its Application to an Industrial Scheduling Problem. In J.P. Sousa et al., eds., Proceedings of the fourth Metaheuristics International Conference MIC\u201901, July 16\u201320, 2001. Pages 79\u201384."},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"X. Gandibleux, X. Delorme and V. T\u2019Kindt. An Ant Colony Algorithm for the Set Packing Problem. In M. Dorigo et al., editor, ANTS 2004, vol 3172 of LNCS, pp 49\u201360. SV, 2004.","DOI":"10.1007\/978-3-540-28646-2_5"},{"key":"31_CR15","unstructured":"R. Hadji, M. Rahoual, E. Talbi, and V. Bachelet. Ant colonies for the set covering problem. In M. Dorigo et al., editor, ANTS 2000, pp 63\u201366, 2000."},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"G. Leguizam\u00f3n and Z. Michalewicz. A new version of Ant System for subset problems. In Congress on Evolutionary Computation, CEC\u201999, pp 1459\u20131464, Piscataway, NJ, USA, 1999. IEEE Press.","DOI":"10.1109\/CEC.1999.782655"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"L. Lessing, I. Dumitrescu, and T. Stutzle. A Comparison Between ACO Algorithms for the Set Covering Problem. In M. Dorigo et al., editor, ANTS 2004, vol 3172 of LNCS, pp 1\u201312. SV, 2004.","DOI":"10.1007\/978-3-540-28646-2_1"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"V. Maniezzo and M. Milandri. An Ant-Based Framework for Very Strongly Constrained Problems. In M. Dorigo et al., editor, ANTS 2002, vol 2463 of LNCS, pp 222\u2013227. SV, 2002.","DOI":"10.1007\/3-540-45724-0_19"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"B. Meyer and A. Ernst. Integrating ACO and Constraint Propagation. In M. Dorigo et al., editor, ANTS 2004, vol 3172 of LNCS, pp 166\u2013177. SV, 2004.","DOI":"10.1007\/978-3-540-28646-2_15"},{"key":"31_CR20","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1007\/BFb0056911","volume":"1498","author":"R. Michel","year":"1998","unstructured":"R. Michel and M. Middendorf. An Island model based Ant system with looka-head for the shortest supersequence problem. Lecture notes in Computer Science, Springer Verlag, 1498:692\u2013701, 1998.","journal-title":"Lecture notes in Computer Science, Springer Verlag"},{"key":"31_CR21","unstructured":"R. L. Rardin. Optimization in Operations Research. Prentice Hall, 1998."}],"container-title":["IFIP International Federation for Information Processing","Professional Practice in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-34749-3_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:45:05Z","timestamp":1605631505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-34749-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387346557"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-34749-3_31","relation":{},"subject":[]}}