山东科学2024，Vol.37Issue(2)：104-116,13.DOI:10.3976/j.issn.1002-4026.20230167
基于鲁棒性模拟的停机位分配问题的数值方法比较
A numerical comparison of methods for solving the gate allocation problem based on robustness simulation
摘要
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引用本文复制引用
刘海滨,王炬博,巴博圣,王瑞昕..基于鲁棒性模拟的停机位分配问题的数值方法比较[J].山东科学,2024,37(2):104-116,13.基金项目
中央高校基本科研业务费项目(3122021084) （3122021084）
天津市应用基础研究多元投入基金(21JCQNJC00790) （21JCQNJC00790）
国家自然科学基金(72301278) （72301278）
