An adaptive large neighborhood search heuristic for solving a robust gate assignment problem

Robust gate assignment problem with transfer passengers and tows is considered.A large neighborhood search heuristic is proposed to solve the integrated problem.Extensive experiments are conducted to justify the performance of our approach. With the rapid growth of air traffic demand, airport capacity becomes a major bottleneck within the air traffic control systems. Minor disturbances may have a large impact on the airport surface operations due to the overly tight schedules, which results in frequent gate conflict occurrences during airports daily operations. A robust gate schedule that is resilient to disturbances is essential for an airport to maintain a good performance. Unfortunately, there is no efficient expert system available for the airport managers to simultaneously consider the traditional cost (the aircraft tow cost, transfer passenger cost) and the robustness. To fill this gap, in this paper, we extend the traditional gate assignment problem and consider a wider scope, in which the traditional costs and the robustness are simultaneously considered. A mathematical model is first built, which leads to a complex non-linear model. To efficiently solve this model, an adaptive large neighborhood search (ALNS) algorithm is then designed. We novelly propose multiple local search operators by exploring the characteristics of the gate assignment problem. The comparison with the benchmark algorithm shows the competitiveness of proposed algorithm in solving the considered problem. Moreover, the proposed methodology also has great potential from the practical perspective since it can be easily integrated into current expert systems to help airport managers make satisfactory decisions.