عرض بسيط للتسجيلة

المؤلف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
معرّف المصادر الموحدhttp://dx.doi.org/10.1057/jors.2015.2
معرّف المصادر الموحدhttp://hdl.handle.net/10576/38720
الملخص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
العنوانSolving a large-scale crew pairing problem
النوعArticle
الصفحات1742-1754
رقم العدد10
رقم المجلد66
dc.accessType Abstract Only


الملفات في هذه التسجيلة

الملفاتالحجمالصيغةالعرض

لا توجد ملفات لها صلة بهذه التسجيلة.

هذه التسجيلة تظهر في المجموعات التالية

عرض بسيط للتسجيلة