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
Integration of constraint programming and metaheuristics
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Multiobjective genetic algorithm to solve the train crew scheduling problem
ISTASC'10 Proceedings of the 10th WSEAS international conference on Systems theory and scientific computation
| Hi-index | 0.00 |
In this paper, we focus on the resolution of Crew Pairing Optimization problem that is very visible and economically significant. Its objective is to find the best schedule, i.e., a collection of crew rotations such that each airline flight is covered by exactly one rotation and the costs are reduced to the minimum. We try to solve it with Ant Colony Optimization algorithms and Hybridizations of Ant Colony Optimization with Constraint Programming techniques. We give an illustrative example about the difficulty of pure Ant Algorithms solving strongly constrained problems. Therefore, we explore the addition of Constraint Programming mechanisms in the construction phase of the ants, so they can complete their solutions. Computational results solving some test instances of Airline Flight Crew Scheduling taken from NorthWest Airlines database are presented showing the advantages of using this kind of hybridization.