This paper refers to the constraints of various resources and processes by which the airport support command and dispatch model guarantees multiple aircraft simultaneously. The paper assumes that the mathematical model of airport security command and dispatch is determined. The complexity of the algorithm is systematically analyzed, and based on the heuristic rules, an corresponding algorithm for the optimization problem is designed. The effectiveness of the algorithm is verified by an example, which shows its important role in guiding airport optimization.

airport security  /  command and dispatch  /  resource allocation