A new multi-commodity flow model to optimize the robustness of the Gate Allocation Problem
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, the focus on two important objectives for the GAP: the robustness and the taxiing times. The authors 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.
- Record URL:
- Record URL:
-
Availability:
- Find a library where document is available. Order URL: http://worldcat.org/issn/0968090X
-
Supplemental Notes:
- © 2021 Elsevier Ltd. All rights reserved. Abstract reprinted with permission of Elsevier.
-
Authors:
- Wang, Ruixin
-
0000-0002-3585-2524
- Allignol, Cyril
- Barnier, Nicolas
-
0000-0002-8496-6835
- Gondran, Alexandre
- Gotteland, Jean-Baptiste
- Mancel, Catherine
- Publication Date: 2022-3
Language
- English
Media Info
- Media Type: Web
- Features: Figures; References; Tables;
- Pagination: 103491
-
Serial:
- Transportation Research Part C: Emerging Technologies
- Volume: 136
- Issue Number: 0
- Publisher: Elsevier
- ISSN: 0968-090X
- Serial URL: http://www.sciencedirect.com/science/journal/0968090X
Subject/Index Terms
- TRT Terms: Commodity flow; Integer programming; Mathematical models; Slot allocation; Taxiing
- Identifier Terms: Aeroport Roissy-Charles de Gaulle
- Subject Areas: Aviation; Operations and Traffic Management; Planning and Forecasting; Terminals and Facilities;
Filing Info
- Accession Number: 01834702
- Record Type: Publication
- Files: TRIS
- Created Date: Jan 28 2022 9:13AM