.png){kind=icon}
.png){kind=icon}
Return
Optimization for gate re-assignment
.png){kind=icon}
PRE
AI
DOI：10.1016/j.trb.2016.11.006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Gate re-assignment
Multi-commodity network flow model
Diving heuristic
Rolling horizon
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.3
Papers:
3.5K
Citations:
1.9W