首页 | 本学科首页   官方微博 | 高级检索  
     

基于航班延误分布的机位鲁棒指派模型
引用本文:李军会, 朱金福, 陈欣. 基于航班延误分布的机位鲁棒指派模型[J]. 交通运输工程学报, 2014, 14(6): 74-82.
作者姓名:李军会  朱金福  陈欣
作者单位:1.南京航空航天大学 经济与管理学院,江苏 南京 210016;;2.新南威尔士大学 民航学院,新南威尔士 悉尼 2052;;3.南京财经大学 管理科学与工程学院,江苏 南京 210046
基金项目:国家自然科学基金项目71171111 国家自然科学基金项目71103034
摘    要:为提高机位指派计划的稳定性与降低航班延误波及效应影响, 以广州白云国际机场历史航班数据为例, 构建了不同航空公司之间差异化的航班延误概率分布, 分析了航班延误分布对机位冲突概率的影响。以机位冲突概率最小为目标函数, 以机位与航班类型为约束条件, 建立了机位鲁棒指派模型, 设计了贪婪禁忌搜索算法, 使用实际航班数据进行实例验证。计算结果表明: 使用提出的机位鲁棒指派模型与贪婪禁忌搜索算法, 获得最优解需要的迭代次数为43, 计算时间为0.72 s, 总的机位冲突概率为2.737 1;使用提出的机位鲁棒指派模型与传统遗传算法, 获得最优解需要的迭代次数为72, 计算时间为35.00 s, 总的机位冲突概率为2.741 2;使用现有的机位闲置时间最大的确定型鲁棒指派方法与提出的贪婪禁忌搜索算法, 总的机位冲突概率为3.018 0。与现有的确定型鲁棒指派方法相比, 提出的机位鲁棒指派模型可使机位计划的鲁棒性提高9.31%。

关 键 词:航空运输   机位指派   航班延误   鲁棒性   冲突概率   贪婪禁忌搜索算法
收稿时间:2014-07-10

Robust assignment model of airport gate based on flight delay distribution
LI Jun-hui, ZHU Jin-fu, CHEN Xin. Robust assignment model of airport gate based on flight delay distribution[J]. Journal of Traffic and Transportation Engineering, 2014, 14(6): 74-82.
Authors:LI Jun-hui  ZHU Jin-fu  CHEN Xin
Affiliation:1. School of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing 210016,Jiangsu, China;;2. School of Airport, University of New South Wales, Sydney 2052, New South Wales, Australia;;3. School of Management Science and Industrial Engineering, Nanjing University of Finance and Economics, Nanjing 210046, Jiangsu, China
Abstract:In order to increase the stability of airport gate assignment plan and reduce the propagation effect of flight delay, the different probability distributions of flight delay between different airline companies were set up by using the historical flight data of Guangzhou Baiyun International Airport, and the effect of flight delay distribution on the conflict probability of airport gate was analyzed.The minimum conflict probability of airport gate was taken as objective function, the types of airport gate and flight were taken as constraint conditions, the robust assignment model of airport gate was set up, the greedy tabu search algorithm was designed, and example verification was carried out by using real flight data.Calculation result shows that by using the proposed model and the greedy tabu search algorithm, the iteration times is 43 and the calculation time is 0.72 swhen the optimal solution is searched, and the total conflict probability is 2.737 1.By using the proposed model and the traditional genetic algorithm, the iteration times is 72 and the calculation time is 35.00 swhen the optimal solution is searched, and the totalconflict probability is 2.741 2.By using the exited deterministic robust assignment method with the maximum gate idle time and the proposed algorithm, the total conflict probability is 3.018 0.Compared with the exited deterministic robust assignment method, the robustness of airport gate plan raises by 9.31% by using the proposed model.
Keywords:air transportation  airport gate assignment  flight delay  robustness  conflict probability  greedy tabu search algorithm
点击此处可从《交通运输工程学报》浏览原始摘要信息
点击此处可从《交通运输工程学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号