A Modified Genetic Algorithm for Fleet Assignment and Routing with Flight Hour Accumulation Consideration

  • 陳 昆逸

Student thesis: Master's Thesis


One essential problem for airline management is to maximize the total profits or minimize the total operating costs through suitable selection of the aircraft from different fleet types for each flight leg Due to the scale of such problem most of previous studies considered dividing the entire problem into two smaller problems fleet assignment problems (FAPs) and aircraft maintenance routing problems (AMRPs) which tend to yield non-global optimal solutions This research tries to integrate the FAP and AMRP The objectives are considered about the profit maximizing with the better level aircraft utilization with accumulated flight hour A multiple traveling salesmen problem (MTSP) model is used to describe the sequence of flights assigned to each aircraft Maintenance nodes are added based on the flight hour accumulation for each aircraft A heuristic Genetic Algorithm (GA) is modified for being proper to solve the combined problem Real data from airlines are used to demonstrate the proposed approach
Date of Award2016 Aug 22
Original languageEnglish
SupervisorTa-Chung Wang (Supervisor)

Cite this