Hybrid approach to crew pairing optimization

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008
Pages869-874
Number of pages6
DOIs
StatePublished - 29 Dec 2008
Event3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008 - Busan, Korea, Republic of
Duration: 11 Nov 200813 Nov 2008

Publication series

NameProceedings - 3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008
Volume2

Conference

Conference3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008
CountryKorea, Republic of
CityBusan
Period11/11/0813/11/08

Fingerprint Dive into the research topics of 'Hybrid approach to crew pairing optimization'. Together they form a unique fingerprint.

Cite this