Solving a large-scale crew pairing problem
dc.contributor.author | Erdoğan, G. | |
dc.contributor.author | Haouari, M. | |
dc.contributor.author | Matoglu, M. Ö. | |
dc.contributor.author | Özener, Okan Örsan | |
dc.date.accessioned | 2015-10-28T06:38:33Z | |
dc.date.available | 2015-10-28T06:38:33Z | |
dc.date.issued | 2015 | |
dc.identifier.issn | 1476-9360 | |
dc.identifier.uri | http://hdl.handle.net/10679/988 | |
dc.identifier.uri | http://www.palgrave-journals.com/jors/journal/v66/n10/full/jors20152a.html | |
dc.description | Due to copyright restrictions, the access to the full text of this article is only available via subscription. | |
dc.description.abstract | 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. | en_US |
dc.description.sponsorship | TÜBİTAK | |
dc.language.iso | eng | en_US |
dc.publisher | Palgrave Macmillan | en_US |
dc.relation | info:turkey/grantAgreement/TUBITAK/110M308 | en_US |
dc.relation.ispartof | Journal of the Operational Research Society | |
dc.rights | restrictedAccess | |
dc.title | Solving a large-scale crew pairing problem | en_US |
dc.type | Article | en_US |
dc.peerreviewed | yes | en_US |
dc.publicationstatus | published | en_US |
dc.contributor.department | Özyeğin University | |
dc.contributor.authorID | (ORCID 0000-0002-9291-1877 & YÖK ID 21945) Özener, Örsan | |
dc.contributor.ozuauthor | Özener, Okan Örsan | |
dc.identifier.volume | 66 | |
dc.identifier.issue | 11 | |
dc.identifier.startpage | 1742 | |
dc.identifier.endpage | 1754 | |
dc.identifier.wos | WOS:000361034100013 | |
dc.identifier.doi | 10.1057/jors.2015.2 | |
dc.subject.keywords | Crew pairing problem | en_US |
dc.subject.keywords | Metaheuristic | en_US |
dc.subject.keywords | Set partitioning | en_US |
dc.subject.keywords | Monthly problem | en_US |
dc.identifier.scopus | SCOPUS:2-s2.0-84940994055 | |
dc.contributor.authorMale | 1 | |
dc.relation.publicationcategory | Article - International Refereed Journal - Institutional Academic Staff |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |
This item appears in the following Collection(s)
Share this page