Abstract
This article analyzes the performance of Ant Colony Optimization algorithms on the resolution of Crew Pairing Problem, one of the most critical processes in airline management operations. Furthermore, we explore the hybridization of Ant algorithms with Constraint Programming techniques. We show that, for the instances tested from Beasley’s OR-Library, the use of this kind of hybrid algorithms obtains good results compared to the best performing metaheuristics in the literature.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alexandrov, D., Kochetov, Y.: Behavior of the ant colony algorithm for the set covering problem. In: Proc. of Symp. Operations Research, pp. 255–260. Springer, Heidelberg (2000)
Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)
Balas, E., Padberg, M.: Set partitioning: A survey. SIAM Review 18, 710–760 (1976)
Beasley, J.E.: Or-library:distributing test problem by electronic mail. Journal of Operational Research Society 41(11), 1069–1072 (1990)
Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. European Journal of Operational Research 94(2), 392–404 (1996)
Chu, P.C., Beasley, J.E.: Constraint handling in genetic algorithms: the set partitoning problem. Journal of Heuristics 4, 323–357 (1998)
Dechter, R., Frost, D.: Backjump-based backtracking for constraint satisfaction problems. Artificial Intelligence 136, 147–188 (2002)
Dorigo, M., Caro, G.D., Gambardella, L.M.: Ant algorithms for discrete optimization. Artificial Life 5, 137–172 (1999)
Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)
Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, USA (2004)
Focacci, F., Laburthe, F., Lodi, A.: Local search and constraint programming. In: Handbook of metaheuristics, Kluwer, Dordrecht (2002)
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–84 (2001)
Gandibleux, X., Delorme, X., T’Kindt, V.: An ant colony algorithm for the set packing problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 49–60. Springer, Heidelberg (2004)
Hadji, R., Rahoual, M., Talbi, E., Bachelet, V.: Ant colonies for the set covering problem. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 63–66. Springer, Heidelberg (2000)
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. 3285, pp. 84–91. Springer, Heidelberg (2004)
Leguizamón, G., Michalewicz, Z.: A new version of ant system for subset problems. In: Congress on Evolutionary Computation, CEC 1999, Piscataway, pp. 1459–1464. IEEE Press, Los Alamitos (1999)
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ützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 1–12. Springer, Heidelberg (2004)
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
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. 2463, pp. 222–227. Springer, Heidelberg (2002)
Meyer, B., Ernst, A.: Integrating aco and constraint propagation. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 166–177. Springer, Heidelberg (2004)
Michel, R., Middendorf, M.: An island model based ant system with lookahead for the shortest supersequence problem. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 692–701. Springer, Heidelberg (1998)
Rardin, R.L.: Optimization in Operations Research. Prentice-Hall, Englewood Cliffs (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Crawford, B., Castro, C., Monfroy, E. (2006). A Hybrid Ant Algorithm for the Airline Crew Pairing Problem. In: Gelbukh, A., Reyes-Garcia, C.A. (eds) MICAI 2006: Advances in Artificial Intelligence. MICAI 2006. Lecture Notes in Computer Science(), vol 4293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11925231_36
Download citation
DOI: https://doi.org/10.1007/11925231_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49026-5
Online ISBN: 978-3-540-49058-6
eBook Packages: Computer ScienceComputer Science (R0)