Author
Erdoğan, G., Haouari, M., Matoglu, M. Ö., Özener, Okan Örsan
Publication Date
2015
Publication Place
-
Palgrave Macmillan
Subject
Crew pairing problem, Metaheuristic, Set partitioning, Monthly problem
Type
Periodical
Language
English
Digital
Yes
Manuscript
No
Library
Özyeğin University
Library Asset ID
1476-9360
Record ID
ddf08be1-e168-4c0f-b1e4-476109ece9bf
Library Location
Industrial Engineering
Date
2015
Notes
Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Sample Text
Airline companies seek to solve the problem of determining an assignment of crews to a pre-determined flight schedule with minimum total cost, called the Crew Pairing Problem (CPP). Most of the existing studies focus on the CPP of North American airlines, which widely differs from that of most European airline companies in terms of the objective function, the flight structure, and the planning horizon. In this study, we develop an optimizationdriven heuristic algorithm that can efficiently handle large-scale instances of the CPP that must be solved on a monthly basis. We perform computational experiments using flight schedules of an European airline company to test the performance of the solution method. Our computational results demonstrate that our algorithm is able to provide high-quality solutions to monthly instances with up to 27 000 flight legs.
DOI
10.1057/jors.2015.2
Cilt
66
