摘要
The Gate Allocation Problem (GAP) is one of the numerous operational problems that all busy airports have to handle and to optimize every day. In this article, we focus on two important objectives for the GAP: the robustness and the taxiing times. We first analyze a basic model which optimizes the robustness of the solution to the GAP and propose a more realistic and compact Multi-commodity Flow Problem model (MFP) to optimize both the robustness and the taxiing times. Based on tests with real data at Paris-Charles-de-Gaulle airport, this new efficient MFP model outperforms the basic one by orders of magnitude.
学科与关键词
关键词
Gate Allocation ProblemRobustnessMulti-commodity flow problemInteger Linear Programming
- New Multi objective models for the gate assignment problemDas, G. Sena*COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 109: 347-356.被引 32
- A review on airport gate assignment problems: Single versus multi objective approachesDas, Gulesin Sena*; Gzara, Fatma; Stutzle, ThomasOMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2020, 92: 102146.被引 61
- A robust strategy to address the airport gate assignment problem considering operators' preferencesShe, Yaqian; Zhao, Qiuhong*; Guo, Renyong; Yu, XianruiCOMPUTERS & INDUSTRIAL ENGINEERING, 2022, 168: 108100.被引 15
