A numerical comparison of methods for solving the gate allocation problem based on robustness simulation
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.
万方数据
维普
