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

考虑缓冲时间成本的鲁棒性停机位分配
引用本文:冯霞,王青召.考虑缓冲时间成本的鲁棒性停机位分配[J].北京理工大学学报,2019,39(4):384-390.
作者姓名:冯霞  王青召
作者单位:中国民航信息技术科研基地,天津300300;中国民航大学计算机科学与技术学院,天津300300;中国民航大学计算机科学与技术学院,天津,300300
基金项目:国家自然科学基金资助项目(61502499);中国民航科技创新引导资金项目重大专项资助项目(MHRD20140105);中央高校科研业务费专项资金资助项目(3122015Z007)
摘    要:针对实际航班提前或延误给停机位分配带来的扰动问题,分析了航班实际到离港时间偏离计划时间的分布规律,提出了基于缓冲时间成本的停机位分配鲁棒性评价函数.在此基础上,建立了以缓冲时间成本、机位-航班大小差异度和远机位数等最小为优化目标的鲁棒性停机位分配模型,设计了求解模型的禁忌搜索算法.基于首都国际机场两个典型的A、B工作日实际运行数据的模型验证结果表明,所提方法与不考虑鲁棒性及传统最小化空闲时间离差平方和的停机位分配相比,在A日航班冲突分别减少了98.1%和97.6%,在B日航班冲突分别减少了74.3%和70.8%,有效地提高了停机位分配计划的鲁棒性. 

关 键 词:停机位分配  禁忌搜索算法  缓冲时间成本  推出-滑入冲突  鲁棒性
收稿时间:2018/1/17 0:00:00

Robust Gate Assignment Considering Buffer Time Cost
FENG Xia and WANG Qing-zhao.Robust Gate Assignment Considering Buffer Time Cost[J].Journal of Beijing Institute of Technology(Natural Science Edition),2019,39(4):384-390.
Authors:FENG Xia and WANG Qing-zhao
Institution:1. Information Technology Research Base of Civil Aviation Administration of China, Tianjin 300300, China;2. College of Computer Science and Technology, Civil Aviation University of China, Tianjin 300300, China
Abstract:Aiming at the perturbation of gate assignment caused by flight operation in early or delay, analyzing the distribution rule of deviation between actual arrival-departure time and plan time of flights in actual operation of airport, a robust evaluation function of gate assignment based on buffer time cost was proposed. On this basis, taking the minimum of buffer time cost, gate-flight size difference and the number of remote gates as the optimization objective, a robust gate assignment model was established. At the same time, a tabu search algorithm was designed to solve the model. The results of model verification based on the actual operating data of two typical working day at Capital International Airport show that, compared with no considering robustness scheme and the traditional method of minimizing the sum of the dispersion square of gate idle time, the flight conflicts are reduced by 98.1% and 97.6% respectively on A day and reduced by 74.3% and 70.8% respectively on B day with the proposed methods, improving the robustness of the gate assignment plan effectively.
Keywords:gate assignment  tabu search algorithm  buffer time cost  push-back and taxi-in conflict  robust
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《北京理工大学学报》浏览原始摘要信息
点击此处可从《北京理工大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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