Show simple item record

AuthorOzener, Okan Orsan
AuthorMatoglu, Melda Ormeci
AuthorErdogan, Gunes
AuthorHaouari, Mohamed
AuthorSozer, Hasan
Available date2020-09-20T08:35:37Z
Publication Date2017
Publication NameAnnals of Operations Research
ISSN2545330
URIhttp://dx.doi.org/10.1007/s10479-016-2319-9
URIhttp://hdl.handle.net/10576/16177
AbstractAirline 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.
Languageen
PublisherSpringer New York LLC
SubjectAirline operations planning
SubjectCrew pairing
SubjectFleet assignment
SubjectLarge-scale neighborhood search
TitleSolving a large-scale integrated fleet assignment and crew pairing problem
TypeArticle
Pagination477-500
Issue Number1
Volume Number253


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record