Cellular automation for double-runway aircraft landing scheduling

摘要

In this article, the cellular automation model is used to solve the problem of double-runway aircraft landing scheduling. A virtual model for simulating the landing process is established based on the cellular automation (CA), and the object of the model is aimed at minimizing the total cost of aircraft landing sequence. The simulation results show that this algorithm is capable of achieving high-quality scheduling results. Meanwhile, the computing time can also be significantly reduced, which shows great efficacy and efficiency of our algorithm in the double-runway aircraft landing scheduling.