Developing an Aircraft Dispatching Model for Temporary Schedule Disturbance while Taking into Account Maintenance Requirements

• Main Authors: Lin Chun-Nan, 林俊男
• Other Authors: Dai Dzwo-Min
• Format: Others
• Language: zh-TW
• Published: 2001
• Online Access: http://ndltd.ncl.edu.tw/handle/91083556155515315761

碩士 === 國立成功大學 === 交通管理學系 === 89 === Temporary aircraft dispatching problem is to dispatch the available aircraft to serve the scheduled flights in the best way while certain aircraft is/are not available for the originally assigned flights due to unexpected incidents. The importance of such a problem increases as the cost of aircraft on ground increases. However, it becomes more and more complicated and cannot be solved efficiently and effectively for airlines as the fleet grows to some extent. This research formulates such a problem while taking in account the network characteristics of the flag carrier of Taiwan, and try to apply the concept of time-aircraft network to solve it. The most important is that the problem studied in this research will consider the maintenance constraints and aircraft utilization in between two scheduled maintenance checks. In fact, the Civil Aviation Authority has very strict regulations regarding aircraft maintenance. All the maintenance requirements are very important factors for aircraft dispatching since they involve airworthiness. The maintenance requirements considered in this research include the maximum flight time between two A-checks, the required ground time for each A-check, the hangar capacity and the available maintenance labor. The objective function is the minimum aircraft dispatching cost and the time loss cost in between two A-checks. We solve this model by combining Branch & Bound algorithm and parameters adjusted. In the model application, this model help to dell with temporary aircraft dispatching problem, to reschedule the Aircraft dispatching problem according to company requirements, to bring up the different suggests when the certain aircraft unavailable.