A Comprehensive Model for Aircraft Maintenance Routing

Please enable javascript in your browser.

Asadi, Hossein | 2010

674 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 40251 (09)
University: Sharif University of Technology
Department: Civil Engineering
Advisor(s): Shafahi, Yousef
Abstract:
One of the fundamental constraints that should have been in mind in flight scheduling is aircraft maintenance scheduling. Based on the accepted rules, regulations and flight safety, in a given period of time or after definite number of flight hours each aircraft should be sent to maintenance site. This influences the flight schedule. This research provides a comprehensive model for the flight scheduling. Given the flight schedule, number of the flights and aircrafts, maintenance center's capacity and other parameters such as each check's time, allowable flight days and allowable flight hours this model could determine each season's flight schedule and solve the aircraft routing problem. Solving this problem leads to preventing the waste of beneficiary flight time of each aircraft while satisfying maintenance constraints. This model is an Integer Programming model with a linear objective function whose variables are binary. Constraints are either in equal shape or unequal shape. Some of these constraints are non-linear. To solve the problem a program has been coded by the Visual Basic language in actual scope which uses Simulated Annealing Algorithm.
Keywords:
Maintenance Scheduling ; Flight Scheduling ; Integer Programming ; Simulated Annealing Method ; Aircraft Routing ; Maintenance Constraints

No TOC