{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:02:22Z","timestamp":1767337342402},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540490265"},{"type":"electronic","value":"9783540490586"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11925231_36","type":"book-chapter","created":{"date-parts":[[2006,11,6]],"date-time":"2006-11-06T14:48:34Z","timestamp":1162824514000},"page":"381-391","source":"Crossref","is-referenced-by-count":8,"title":["A Hybrid Ant Algorithm for the Airline Crew Pairing Problem"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Castro","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Monfroy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_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":"36_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of Constraint Programming","author":"K.R. Apt","year":"2003","unstructured":"Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)"},{"key":"36_CR3","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":"36_CR4","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.2307\/2582903","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":"36_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":"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":"36_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":"36_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0004-3702(02)00120-0","volume":"136","author":"R. Dechter","year":"2002","unstructured":"Dechter, R., Frost, D.: Backjump-based backtracking for constraint satisfaction problems. Artificial Intelligence\u00a0136, 147\u2013188 (2002)","journal-title":"Artificial Intelligence"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., Caro, G.D., Gambardella, L.M.: Ant algorithms for discrete optimization. Artificial Life\u00a05, 137\u2013172 (1999)","journal-title":"Artificial Life"},{"issue":"1","key":"36_CR9","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":"36_CR10","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":"36_CR11","volume-title":"Handbook of metaheuristics","author":"F. Focacci","year":"2002","unstructured":"Focacci, F., Laburthe, F., Lodi, A.: Local search and constraint programming. In: Handbook of metaheuristics, Kluwer, Dordrecht (2002)"},{"key":"36_CR12","unstructured":"Gagne, C., Gravel, M., Price, W.: 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 2001, pp. 79\u201384 (2001)"},{"key":"36_CR13","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":"36_CR14","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":"36_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-30176-9_11","volume-title":"Applied Computing","author":"K. Kotecha","year":"2004","unstructured":"Kotecha, K., Sanghani, G., Gambhava, N.: Genetic algorithm for airline crew scheduling problem using cost-based uniform crossover. In: Manandhar, S., Austin, J., Desai, U., Oyanagi, Y., Talukder, A.K. (eds.) AACC 2004. LNCS, vol.\u00a03285, pp. 84\u201391. Springer, Heidelberg (2004)"},{"key":"36_CR16","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, pp. 1459\u20131464. IEEE Press, Los Alamitos (1999)"},{"key":"36_CR17","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":"36_CR18","doi-asserted-by":"crossref","unstructured":"Levine, D.: A parallel genetic algorithm for the set partitioning problem. Technical Report ANL-94\/23 Argonne National Laboratory (May 1994), available at http:\/\/citeseer.ist.psu.edu\/levine94parallel.html","DOI":"10.2172\/10161119"},{"key":"36_CR19","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":"36_CR20","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":"36_CR21","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)"},{"key":"36_CR22","volume-title":"Optimization in Operations Research","author":"R.L. Rardin","year":"1998","unstructured":"Rardin, R.L.: Optimization in Operations Research. Prentice-Hall, Englewood Cliffs (1998)"}],"container-title":["Lecture Notes in Computer Science","MICAI 2006: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11925231_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:45:34Z","timestamp":1619509534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11925231_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540490265","9783540490586"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11925231_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}