Taxiing Path Optimization of Arriving and Departing Flights Considering Taxiing Conflicts
Aiming at the optimization problem of flight taxiing paths in airport flight zones,the network diagram of the flight zones was drawn according to the actual layout of the airport,and the typical taxiing conflict problem was simplified into the node and section conflict problem.A model was established to minimize the taxiing distance of incoming and outgoing flights,and the genetic algorithm was used to solve the problem.An example analysis was carried out using Nantong Xingdong Airport as an example to verify the effectiveness of the model,which provides a feasible method for flight taxiing path optimization.
万方数据
维普
