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

المؤلفOzener, Okan Orsan
المؤلفMatoglu, Melda Ormeci
المؤلفErdogan, Gunes
المؤلفHaouari, Mohamed
المؤلفSozer, Hasan
تاريخ الإتاحة2020-09-20T08:35:37Z
تاريخ النشر2017
اسم المنشورAnnals of Operations Research
المصدرScopus
الرقم المعياري الدولي للكتاب2545330
معرّف المصادر الموحدhttp://dx.doi.org/10.1007/s10479-016-2319-9
معرّف المصادر الموحدhttp://hdl.handle.net/10576/16177
الملخصAirline 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.
اللغةen
الناشرSpringer New York LLC
الموضوعAirline operations planning
Crew pairing
Fleet assignment
Large-scale neighborhood search
العنوانSolving a large-scale integrated fleet assignment and crew pairing problem
النوعArticle
الصفحات477-500
رقم العدد1
رقم المجلد253
dc.accessType Abstract Only


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

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

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

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

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