Ant algorithms for discrete optimization
Artificial Life
Backjump-based backtracking for constraint satisfaction problems
Artificial Intelligence
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
Journal of Heuristics
An Island Model Based Ant System with Lookahead for the Shortest Supersequence Problem
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
An Ant-Based Framework for Very Strongly Constrained Problems
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Ant Colony Optimization
Principles of Constraint Programming
Principles of Constraint Programming
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
An ant-based solver for subset problems
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
Decomposition approach to solve dial-a-ride problems using ant computing and constraint programming
BVAI'07 Proceedings of the 2nd international conference on Advances in brain, vision and artificial intelligence
A hybrid meta-heuristic algorithm for optimization of crew scheduling
Applied Soft Computing
| Hi-index | 0.00 |
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.