| Summary: | 碩士 === 國立成功大學 === 民航研究所 === 106 === Our sky has become overcrowded due to an increase in yearly air transports, which in turn has caused a shortage in airport capacity. Aircraft flow constraints result in delays in busy airports during peak times and will in turn increase the costs for airline companies. The current method used by air traffic controllers (ATCs) is First-Come-First-Served (FCFS). However, this method is insufficient to solve the sequence issues faced by aircraft. In this research, an optimal partition method is proposed to decrease the scheduling algorithm calculation time. In the algorithm, the sequence is broken down into several smaller subsequences and rescheduled to the aforementioned sequences with two main targets. The first target is to try to reduce the total computation time, which enables the computation of a longer sequence than was possible in the past. The second target would be to alter the previous sequence into a new and more efficient way for aircraft to land. Aircraft are overlapped between subsequences to ensure this method doesn’t happen while scheduling the sequence without overlapping, both separated subsequences have their optimal sequence. Once the separated sequences are combined, however, the complete sequence may not have the most optimal sequencing. The new approach sequence allows aircraft to land faster and in a more orderly fashion than the original sequence, thus reducing the makespan period. Finally, several simulation results are used to demonstrate the effectiveness of the proposed approach phase.
|
|---|
