Show simple item record

AuthorErdoğan, Güneş
AuthorHaouari, Mohamed
AuthorMatoglu, Melda Örmeci
AuthorÖzener, Okan Örsan
Available date2023-01-23T08:18:14Z
Publication Date2015
Publication NameJournal of the Operational Research Society
ResourceScopus
URIhttp://dx.doi.org/10.1057/jors.2015.2
URIhttp://hdl.handle.net/10576/38720
AbstractAirline 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 optimization-driven 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. 2015 Operational Research Society Ltd.
SponsorAcknowledgements-This project is funded in part by TUBITAK grant 110M308. We thank the five anonymous referees for their valuable comments, which have improved the paper substantially.
Languageen
PublisherPalgrave Macmillan Ltd.
Subjectcrew pairing problem
metaheuristic
monthly problem
set partitioning
TitleSolving a large-scale crew pairing problem
TypeArticle
Pagination1742-1754
Issue Number10
Volume Number66
dc.accessType Abstract Only


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