.png){kind=icon}
返回
Optimization for gate re-assignment
.png){kind=icon}
PRE
AI
DOI：10.1016/j.trb.2016.11.006.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Disruptions such as adverse weather, flight delays and flight cancellations are a frequent occurrence in airport operations. A sophisticated gate assignment plan can be easily disrupted and serious consequences might be caused. Therefore, an efficient gate reassignment methodology is of great importance for the airline industry. In this paper, we propose an efficient gate re-assignment methodology to deal with the disruptions, in which the objective function is to minimize the weighted sum of the total flight delays, the number of gate re-assignment operations and the number of missed passenger connections. Two multi-commodity network flow models are built for the pure gate re-assignment problem and the gate re-assignment problem with connecting passengers. Recognizing the inherent NP hard nature of the gate re-assignment problem, two heuristic algorithms are proposed to solve the models efficiently. The proposed models and algorithms are tested based on real-world data of a large U.S. carrier and computational results reveal that the proposed methodologies can provide high quality solutions within a short computational time. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Gate re-assignment
Multi-commodity network flow model
Diving heuristic
Rolling horizon
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
3.6K
被引数:
2.1W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容