| Summary: | 碩士 === 國立成功大學 === 民航研究所 === 98 === Flow control is one of the major problems for busy airports during rush hours. Air traffic controllers (ATCs) must quickly arrange the approaching sequence of the aircraft and make necessary separation arrangements. This paper presents a scheduling algorithm to generate the optimal arrival sequence, which utilizes both mixed-integer programming and quadratic programming. Firstly, using mixed-integer programming, the estimated arrival time for each aircraft and the separation time required between different types of aircraft are used to find an optimal sequence that attains the minimum time required for all the aircraft in a pre-specified time window to arrive at the airport. A separation time matrix generated using the separation time between different types of aircraft is used to construct the constraints. Secondly, we use quadratic programming to modify the speed of the aircraft in the pre-specified time window to obtain the minimal arrival time variation after using the optimal scheduling sequence. The speed change capabilities for different aircraft are also considered in the constraints. Using the proposed two-stage optimization process, the final results will meet both optimal sequence and minimal time variation requirements if the aircraft use the suggested velocity in the pre-specified time window. Finally, historical data for Taiwan Taoyuan International Airport is used to demonstrate the effectiveness of our approach.
|
|---|
