A Composite Dispatching Rule-Based Method for Multi-Objective Aircraft Landing Problem

The high air traffic demand and scarce supply of resources have imposed intense pressure on the air transportation system. In this study, we propose a new method to solve the multi-objective aircraft landing problem quickly. Firstly, we comb the different criteria of the aircraft landing problem, and we choose the average scheduled time, maximum flow time, and maximum delay time as multiple objectives. Secondly, we formulate the model of the multi-objective aircraft landing problem and present the appropriate algorithms to solve the problem. In addition, a new composite dispatching rule is developed to solve the multi-objective aircraft landing problem with high computational efficiency. Finally, the performance of the proposed method is evaluated by a set of benchmark instances and in a real case scenario. The computational results illustrate the efficiency of our approach, which could simultaneously enhance the runway capacity, maximize the cost-effectiveness of airlines, and reduce the workloads of air traffic controllers.