Havayolu operasyonlarında uçuş eşleme için sezgisel bir yaklaşımın geliştirilmesi


Thesis Type: Postgraduate

Institution Of The Thesis: Yıldız Technical University, Graduate School of Natural and Applied Sciences, ENDÜSTRİ MÜHENDİSLİĞİ ANABİLİM DALI, Turkey

Approval Date: 2019

Thesis Language: Turkish

Student: MELEK SEBİLE KURTER

Supervisor: Tufan Demirel

Open Archive Collection: AVESIS Open Access Collection

Abstract:

Aviation industry in Turkey has been growing tremendously in the recent years. Air transportation system consists of various integrated complex systems. Due to the nature of complexity, it is subject to academic studies in various fields under different topics. The profitability in Air Transportation industry is mostly driven by optimizing the planning, operation efficiency and management. The most expensive costs in the industry is crew planning, flight scheduling, airplane, maintenance, repair, overhaul, jet fuel, and engineering activities. Crew planning is the most expensive cost right after jet fuel. In order to maintain their presence in an increasingly competitive industry, airlines are required to make more efficient planning. In this context, airlines need effective resource planning and scheduling methods. While developing these kind of methods, airlines must comply the requirements published by the national and international authorities such as General Directorate of Civil Aviation In this study, an intuitive approach based on sweep algorithm is presented for a crew pairing problem which can be realized with the lowest cost and all flights are considered. While developing the algorithm, sweep algorithm which is commonly used in vehicle routing problems has been utilized. Algorithm language has been developed in Visual Studio environment. The accuracy and efficiency of the algorithm established with the actual flight data of a private airline. 3 different set of data has been utilized to measure the response rate of the algorithm. The algorithm starts at each flight point in the data set and scans for the least expensive solution which covers all flights. Keywords: Airline flight pairing, crew pairing problem, sweep algorithm, vehicle routing problem