Shandong Science ›› 2024, Vol. 37 ›› Issue (2): 104-116.doi: 10.3976/j.issn.1002-4026.20230167

• Traffic and Transportation • Previous Articles     Next Articles

A numerical comparison of methods for solving the gate allocation problem based on robustness simulation

LIU Haibin1(), WANG Jubo2, BA Bosheng2, WANG Ruixin2,*()   

  1. 1. Tianjin Sub-bureau of North China Regional Air Traffic Management Bureau,CAAC,Tianjin 300300,China
    2. Sino-European Institute of Aviation Engineering,Civil Aviation University of China,Tianjin 300300,China
  • Received:2023-11-08 Online:2024-04-20 Published:2024-04-09

Abstract:

Frequent delays of flights at large international airports can affect their smooth operation, hence, the airport apron allocation problem needs to be robustly optimized. In this study, we proposed two integer linear-programing models for solving this problem and used two algorithms for performance comparison: the hill-climbing and large-neighborhood search (LNS) metaheuristic algorithms. In addition, we used the Monte Carlo method to evaluate the effectiveness of different objective functions in dealing with flight conflicts. The final test results show that the LNS algorithm not only improves the robustness of the gate allocation scheme for large airports but also excels in speed and quality, especially, when the square of idle time is used as the objective function.

Key words: gate allocation, fixed job problem, airport, combinatorial optimization, large-neighborhood search, linear programing

CLC Number: 

  • U-9