TY - GEN
T1 - Hybrid approach to crew pairing optimization
AU - Crawford, Broderick
AU - Rodríguez, Nibaldo
AU - Castro, Carlos
AU - Monfroy, Eric
PY - 2008
Y1 - 2008
N2 - In order to be able to solve any combinatorial optimization problem It seems that a good idea is to use both Incomplete and complete techniques together. When problems are easy enough to allow searching for the optimal solution, complete techniques can be used. When problems become harder, incomplete techniques represent a good alternative in order to solve approximately the problem. Particularly, promising possibilities of hybrizing Constraint Programming and Ant metaheuristics to solve crew pairing are pointed out in this work.
AB - In order to be able to solve any combinatorial optimization problem It seems that a good idea is to use both Incomplete and complete techniques together. When problems are easy enough to allow searching for the optimal solution, complete techniques can be used. When problems become harder, incomplete techniques represent a good alternative in order to solve approximately the problem. Particularly, promising possibilities of hybrizing Constraint Programming and Ant metaheuristics to solve crew pairing are pointed out in this work.
UR - http://www.scopus.com/inward/record.url?scp=57849136906&partnerID=8YFLogxK
U2 - 10.1109/ICCIT.2008.155
DO - 10.1109/ICCIT.2008.155
M3 - Conference contribution
AN - SCOPUS:57849136906
SN - 9780769534077
T3 - Proceedings - 3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008
SP - 869
EP - 874
BT - Proceedings - 3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008
T2 - 3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008
Y2 - 11 November 2008 through 13 November 2008
ER -