基于航班网络的受扰航班一体化恢复模型

中国民航大学学报 ›› 2020, Vol. 38 ›› Issue (5): 29-34.

基于航班网络的受扰航班一体化恢复模型

彭连锁¹，王梓旭²，王兴隆³

1. 中国国际航空股份有限公司，北京100621；2. 首都机场集团公司，北京大兴国际机场，北京102604；3. 中国民航大学空中交通管理学院，天津300300

出版日期:2020-10-25 发布日期:2020-10-23
作者简介:彭连锁（1976—），男，北京人，工程师，本科，研究方向为航空公司飞行安全.
基金资助:
国家重点研发计划项目（2016YFB0502405）

Integrated recovery model of disrupted flights based on flight network

PENG Liansuo¹, WANG Zixu², WANG Xinglong³

1. Air China Limited, Beijing 100621, China; 2. Capital Airports Holding Company, Beijing Daxing International Airport, Beijing 102604, China; 3. College of Air Traffic Management, CAUC, Tianjin 300300, China

Online:2020-10-25 Published:2020-10-23

摘要/Abstract

摘要： 针对航班扰动人工恢复和分阶段恢复的弊端，构建飞机、机组与旅客恢复的受扰航班一体化恢复模型。改进传统航班网络，利用基于广度优先搜索的航班网络生成算法，采用路径置换、路径延长、路径取消等恢复策略对航班恢复决策过程进行建模。采用DW 分解算法，设计3 种子问题迭代求解。场景算例验证表明，一体化恢复模型可在有效时间内获得满意解。

关键词:

航班扰动, 广度优先搜索, 航班网络生成, DW 分解, 一体化航班恢复

Abstract: Aiming at the shortcomings of manual recover and staged recover, the integrated recovery model of disrupted flights is constructed considering aircraft, crew and passengers. Traditional flight network is improved, and a flight network generation algorithm based on breadth-first search is employed to model the flight recover decision process by using strategies including path replacement, path extension, path cancellation strategies. DW decomposition algorithm is used to design three kinds of subproblem and to get the iterative solution. Simulation of scenario examples shows that the proposed integrated recovery model can obtain a satisfactory solution within the effective time.

Key words: flight disruption, breadth-first search, flight network generation, DW decomposition, integrated flight recovery

中图分类号:

彭连锁, 王梓旭, 王兴隆. 基于航班网络的受扰航班一体化恢复模型[J]. 中国民航大学学报, 2020, 38(5): 29-34.

PENG Liansuo, WANG Zixu, WANG Xinglong. Integrated recovery model of disrupted flights based on flight network[J]. Journal of Civil Aviation University of China, 2020, 38(5): 29-34.

参考文献 15

[1]	LETTOYSKY L. Airline operations recovery: an optimization approach[D]. Atlanta: Georgia Institute of Technology, 1997.
[2]	乐美龙, 王倩倩. 动态时空衔接的一体化恢复[J]. 辽宁工程技术大学学报(自然科学版), 2014, 33(5): 696-699.
[3]	朱博, 朱金福, 高强. 飞机和机组一体化恢复的约束规划模型[J].交通运输工程学报, 2013, 13(1): 77-83.
[4]	BISAILLON S, FRANCOIS J, GILBERT L, at al. A large neighborhood search heuristic for the aircraft and passenger recovery problem[J]. A Quarterly Journal of Operations Research, 2011, 9(2): 139-157.
[5]	SINCLAIR K, JEAN F, GILBERT L. A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem[J]. Computers & Operations Research, 2016, 65: 42-52.
[6]	TEODOROVIC D, GUBERINIC S. Optimal dispatching strategy on an airline network after a schedule perturbation[J]. European Journal of Operational Research,1984, 15(2): 178-182.
[7]	TEODOROVIC D A. model for designing the meteorologicany most reliable airline schedule[J]. European Journal of Operational Research,1985, 21(2): 156-164.
[8]	TEODOROVIC D, STOJKOVIC G. Model for operational daily airline scheduling[J]. Transportation Planning and Technology, 1990, 14(4):273-285.
[9]	TEODOROVIC D, STOJKOVIC G. Model to reduce airline schedule disturbances[J]. Journal of Transportation Engineering, 1995, 121(4):324-331.
[10]	吴刚, 严俊. 不正常航班恢复的一种改进的列生成算法[J]. 南京航空航天大学学报, 2014, 46(2): 329-334.
[11]	田倩南, 李昆鹏, 李文莉, 等. 受扰航班恢复问题的优化方案研究[J].管理学报, 2018, 15(10): 1081-1088.
[12]	HANIF D, BAE K H, MOHAMED H. An integrated approach for airline flight selection and timing, fleet assignment, and aircraft routing[J].Transportation Science, 2013, 47(4): 455-628.
[13]	AKTURK M S, ATAMTURK A, GUREL S. Aircraft rescheduling with cruise speed control[J]. Operational Research. 2014, 62(4): 829-845.
[14]	UGUR A, SINAN G M, SELIM A. Integrated aircraft and passenger recoverywith cruise time controllability[J]. Annals of Operations Research,2016, 236(13): 295-317.
[15]	LIANG ZHE, FAN XIAO, QIAN XIONGWEN. A column generationbased heuristic for aircraft recovery problem with airport capacity constraints and maintenance flexibility[J]. Transportation Research Part B,2018, 113(5):70-90.