Author
Özener, Okan Örsan, Örmeci Matoğlu, M., Erdoğan, G., Haouari, M., Sözer, Hasan
Publication Date
2017
Publication Place
-
Springer International Publishing
Subject
Fleet assignment, Crew pairing, Airline operations planning, Large-scale neighborhood search
Type
Periodical
Language
English
Digital
Yes
Manuscript
No
Library
Özyeğin University
Library Asset ID
0254-5330
Record ID
d76f3ab3-cb6a-4ff9-ab01-cf7e7350eb16
Library Location
Industrial Engineering, Computer Science
Date
2017
Notes
Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Sample Text
Airline schedule planning problems are typically decomposed into smaller problems, which are solved in a sequential manner, due to the complexity of the overall problems. This results in suboptimal solutions as well as feasibility issues in the consecutive phases. In this study, we address the integrated fleet assignment and crew pairing problem (IFACPP) of a European Airline. The specific network and cost structures allow us to develop novel approaches to this integrated problem. We propose an optimization-driven algorithm that can efficiently handle large scale instances of the IFACPP. We perform a computational study on real-world monthly flight schedules to test the performance of our solution method. Based on the results on instances with up to 27,500 flight legs, we show that our algorithm provides solutions with significant cost savings over the sequential approach.
DOI
10.1007/s10479-016-2319-9
Cilt
253
