TCPN Based Runway Scheduling For Airport Arrival And Departure

With the rapid development of economy, the problem of flight congestion in the terminal areahas become the core link of the air traffic. In order to solve this problem, the majority of airportsby building more runways to alleviate the airport ground traffic to a certain extent. But in a unit oftime, when there are some flights crowded, the scheduling of controllers may cause the problem ofwasting of runway resource and unfairness.In view of the above questions, this paper considered double runways in the currentenvironment. According to the characteristic of approach and departure flights, the model ofextended high-ranking Petri net is established, which will treat the double runways scheduling as areal-time task scheduling system. The TCPN parallel scheduling model is converted into a stricttime colored Petri net model and make effective formal analysis. Maximize the total delay andthe minimize throughput of airport per unit time, the fair scheduling of aircrafts and the usage ofmulti-runways, solving the approach and departure flights scheduling problem in the level ofparallel scheduling. Finally, make simulation of data of approach and departure flights in theterminal area. The results show that the time complexity of parallel scheduling algorithm isminimal, single flight delay time as well as total delay time is smallest, the highest rate of flightscheduling, which can explain that the parallel scheduling algorithm is better than FCFS andgenetic scheduling algorithm.The model of TCPN double parallel runways flight scheduling and parallel schedulingalgorithm are accorded with the actual situation of the airport’s double runways.It provides ascientific formal analysis for relieving congestion and improving airport throughput.