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. © 2008 IEEE.
|Number of pages||6|
|Publication status||Published - 29 Dec 2008|
|Event||Proceedings - 3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008 - |
Duration: 29 Dec 2008 → …
|Conference||Proceedings - 3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008|
|Period||29/12/08 → …|