To reduce aircraft taxiing time and improve the efficiency of airport surface utilization, this paper establishes a
mixed integer linear programming model for aircraft dynamic taxiing. The model aims to minimize the total operating cost and is constrained by taxi safety intervals and conflict avoidance. The essence of the model belongs to the
dynamic traveling salesman problem (TSP). Therefore, computational experiments are conducted based on the scene
configuration data and 33 takeoff and landing flight data of Guangzhou Baiyun International Airport (Baiyun Airport). For the convenience of research, this article first applies graph theory processing to the physical scene to establish a graph theory model, using intersection points, endpoints, and segmentation points as points, and runway
and taxiway segmentation as edges. Based on the arrival (departure) situation, a directed graph is established to
ensure that the aircraft slides towards the parking position (runway). Special point designs have been adopted to
avoid conflicts with departing flights when handling runway crossings. In order to solve the problem using Cplex
optimizer, the model linearizes the nonlinear constraints. In order to verify the correctness of the model, a calculation experiment is conducted without considering conflicts to prove its ability to find the shortest path. Then, a time
stamp, i.e. a time window, was attached to perform calculation of dynamic optimization path to avoid conflicts. The
results indicate that the mixed integer linear programming model for aircraft dynamic taxiing can effectively obtain
the optimized path for dynamic takeoff and landing taxiing. In Baiyun Airport, the east-west separated operation,
i.e. the runway assignment "nearby mode", can be used for aircraft taxiing optimization scheduling