Solving a large-scale crew pairing problem
المؤلف | Erdoğan, Güneş |
المؤلف | Haouari, Mohamed |
المؤلف | Matoglu, Melda Örmeci |
المؤلف | Özener, Okan Örsan |
تاريخ الإتاحة | 2023-01-23T08:18:14Z |
تاريخ النشر | 2015 |
اسم المنشور | Journal of the Operational Research Society |
المصدر | Scopus |
الملخص | 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 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. |
راعي المشروع | Acknowledgements-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. |
اللغة | en |
الناشر | Palgrave Macmillan Ltd. |
الموضوع | crew pairing problem metaheuristic monthly problem set partitioning |
النوع | Article |
الصفحات | 1742-1754 |
رقم العدد | 10 |
رقم المجلد | 66 |
الملفات في هذه التسجيلة
الملفات | الحجم | الصيغة | العرض |
---|---|---|---|
لا توجد ملفات لها صلة بهذه التسجيلة. |
هذه التسجيلة تظهر في المجموعات التالية
-
الهندسة الميكانيكية والصناعية [1343 items ]