Volume 24, Issue 4 (IJIEPR 2013)                   IJIEPR 2013, 24(4): 259-268 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Reisi M, Moslehi G. Cockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach. IJIEPR 2013; 24 (4) :259-268
URL: http://ijiepr.iust.ac.ir/article-1-295-en.html
1- Department of Industrial and Systems Engineering
2- Department of Industrial and Systems Engineering , moslehi@cc.iut.ac.ir
Abstract:   (7191 Views)
Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for modelling the problem at hand and, because it is classified in large scale problems, the column generation approach has been used to solve LP relaxation of the set partitioning model. Our focus will be on solving the column generation sub-problem. For this purpose, two algorithms, named SPRCF and SPRCD, have been developed based on the shortest path with resource constraint algorithms. Their efficiency in solving some problem instances has been tested and the results have been compared with those of an algorithm for crew pairing problem reported in the literature. Results indicate the high efficiency of the proposed algorithms in solving problem instances with up to 632 flight legs in a reasonable time.
Full-Text [PDF 529 kb]   (2986 Downloads)    
Type of Study: Research | Subject: Operations Research
Received: 2011/08/6 | Accepted: 2014/02/2 | Published: 2014/02/2

Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.