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. © Springer-Verlag Berlin Heidelberg 2006.
Author supplied keywords
Cite
CITATION STYLE
Crawford, B., Castro, C., & Morifroy, E. (2006). A hybrid ant algorithm for the airline crew pairing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4293 LNAI, pp. 381–391). Springer Verlag. https://doi.org/10.1007/11925231_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
