Terminal Area Air Traffic Flow Management Model And Algorithm Research

The urgent problem facing the present civil airline is how to enhance the air traffic management in terminal area and to ensure the save of flight.This paper mainly focuses on the air sequencing problem in terminal area. By means of the single-machine scheduling method,the practical problem is reformulated into the Cumulative Traveling Salesman Problem with Ready Times(CTSR-RT). A mathematical model is firstly proposed. Then the greedy heuristic algorithm is applied to solve the model.While rearranging the sequence,the position of the individual aircraft approaching the runway might be shifted many times,which causes an excessive schedule delay and aggravate the burden on the air traffic controller. Taking into account of this problem,the model is modified by introducing two constraints parameters related to the number of shifting of an individual aircraft:Maximum Position Shifting (MPS) and Relative Position Shifting(RPS). To control the position of the aircraft with these two parameters, we solve the above problems with efficiency.Four practical sequencing examples are given to test the algorithms. In each one of the considered ease, the greedy heuristic algorithm proves to be superior to FCFS, and the minimization of schedule delay and reduction of related costs are achieved.