{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:15:22Z","timestamp":1725578122147},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540357483"},{"type":"electronic","value":"9783540357506"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11785231_113","type":"book-chapter","created":{"date-parts":[[2006,7,2]],"date-time":"2006-07-02T06:01:11Z","timestamp":1151820071000},"page":"1082-1090","source":"Crossref","is-referenced-by-count":16,"title":["Integrating Lookahead and Post Processing Procedures with ACO for Solving Set Partitioning and Covering Problems"],"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":"113_CR1","first-page":"255","volume-title":"Proc. of Symp. Operations Research","author":"D. Alexandrov","year":"2000","unstructured":"Alexandrov, D., Kochetov, Y.: Behavior of the Ant Colony Algorithm for the Set Covering Problem. In: Proc. of Symp. Operations Research, pp. 255\u2013260. Springer, Heidelberg (2000)"},{"key":"113_CR2","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E. Balas","year":"1976","unstructured":"Balas, E., Padberg, M.: Set Partitioning: A Survey. SIAM Review\u00a018, 710\u2013760 (1976)","journal-title":"SIAM Review"},{"issue":"11","key":"113_CR3","doi-asserted-by":"crossref","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 problem by electronic mail. Journal of Operational Research Society\u00a041(11), 1069\u20131072 (1990)","journal-title":"Journal of Operational Research Society"},{"issue":"2","key":"113_CR4","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"J.E. Beasley","year":"1996","unstructured":"Beasley, J.E., Chu, P.C.: 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":"113_CR5","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1023\/A:1018900128545","volume":"86","author":"M.J. 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. Annals of Operations Research\u00a086, 611\u2013627 (1999)","journal-title":"Annals of Operations Research"},{"key":"113_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1023\/A:1008668508685","volume":"4","author":"P.C. Chu","year":"1998","unstructured":"Chu, P.C., Beasley, J.E.: Constraint handling in genetic algorithms: the set partitoning problem. Journal of Heuristics\u00a04, 323\u2013357 (1998)","journal-title":"Journal of Heuristics"},{"key":"113_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant Algorithms for Discrete Optimization. Artificial Life\u00a05, 137\u2013172 (1999)","journal-title":"Artificial Life"},{"issue":"1","key":"113_CR8","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":"113_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/b99492","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, USA (2004)"},{"key":"113_CR10","first-page":"67","volume":"8","author":"A. Feo","year":"1989","unstructured":"Feo, A., Mauricio, G., Resende, A.: A Probabilistic Heuristic for a Computationally Difficult Set Covering Problem. OR Letters\u00a08, 67\u201371 (1989)","journal-title":"OR Letters"},{"key":"113_CR11","unstructured":"Gagne, C., Gravel, M., Price, W.L.: A Look-Ahead Addition to the Ant Colony Optimization Metaheuristic and its Application to an Industrial Scheduling Problem. In: Sousa, J.P., et al. (eds.) Proceedings of the fourth Metaheuristics International Conference MIC 2001, July 16-20, 2001, pp. 79\u201384 (2001)"},{"key":"113_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-540-28646-2_5","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"X. Gandibleux","year":"2004","unstructured":"Gandibleux, X., Delorme, X., T\u2019Kindt, V.: An Ant Colony Algorithm for the Set Packing Problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., St\u00fctzle, T. (eds.) ANTS 2004. LNCS, vol.\u00a03172, pp. 49\u201360. Springer, Heidelberg (2004)"},{"key":"113_CR13","series-title":"Lecture Notes in Computer Science","first-page":"63","volume-title":"Algorithmic Number Theory","author":"R. Hadji","year":"2000","unstructured":"Hadji, R., Rahoual, M., Talbi, E., Bachelet, V.: Ant colonies for the set covering problem. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 63\u201366. Springer, Heidelberg (2000)"},{"key":"113_CR14","first-page":"1459","volume-title":"Congress on Evolutionary Computation, CEC 1999","author":"G. Leguizam\u00f3n","year":"1999","unstructured":"Leguizam\u00f3n, G., Michalewicz, Z.: A new version of Ant System for subset problems. In: Congress on Evolutionary Computation, CEC 1999, Piscataway, NJ, USA, pp. 1459\u20131464. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"113_CR15","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., Stutzle, 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":"113_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45724-0_19","volume-title":"Ant Algorithms","author":"V. Maniezzo","year":"2002","unstructured":"Maniezzo, V., Milandri, M.: An Ant-Based Framework for Very Strongly Constrained Problems. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol.\u00a02463, pp. 222\u2013227. Springer, Heidelberg (2002)"},{"key":"113_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-28646-2_15","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"B. Meyer","year":"2004","unstructured":"Meyer, B., Ernst, A.: Integrating ACO and Constraint Propagation. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., St\u00fctzle, T. (eds.) ANTS 2004. LNCS, vol.\u00a03172, pp. 166\u2013177. Springer, Heidelberg (2004)"},{"key":"113_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1007\/BFb0056911","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"R. Michel","year":"1998","unstructured":"Michel, R., Middendorf, M.: An Island model based Ant system with lookahead for the shortest supersequence problem. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 692\u2013701. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing \u2013 ICAISC 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11785231_113.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:08:35Z","timestamp":1605643715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11785231_113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540357483","9783540357506"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11785231_113","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}