Hybrid Approach to Crew Pairing Optimization

Author

Crawford, Broderick ; Rodriguez, N. ; Castro, Carlos ; Monfroy, Eric

Author_Institution

Pontificia Univ. Catolica de Valparaiso, Valparaiso

Volume

2

fYear

2008

fDate

11-13 Nov. 2008

Firstpage

869

Lastpage

874

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.

Keywords

combinatorial mathematics; constraint handling; human resource management; optimisation; search problems; travel industry; ant metaheuristics; combinatorial optimization problem; constraint programming; crew pairing optimization; hybrid approach; optimal solution searching; Artificial intelligence; Cities and towns; Constraint optimization; Cost function; Finishing; Information technology; Leg; Operations research; Partitioning algorithms; Testing; Ant Colony Optimization; Constraint Programming; Constraint Satisfaction Problems;

fLanguage

English

Publisher

ieee

Conference_Titel

Convergence and Hybrid Information Technology, 2008. ICCIT '08. Third International Conference on

Conference_Location

Busan

Print_ISBN

978-0-7695-3407-7

Type

conf

DOI

10.1109/ICCIT.2008.155

Filename

4682355