An airport gate reassignment problem with gate closures

Date

2024-03-01

Author

Poyraz, Dursen Deniz
Azizoğlu, Meral

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

135
views

31
downloads

Cite This

In this study, we consider an airport gate reassignment problem where an airport has assigned gates to aircraft, but then a disruption occurs at some of the gates. After the disruption, we need to reassign the aircraft to the gates while taking into account both efficiency and stability measures. For efficiency, we want to use the gates as much as possible, considering both the number of aircraft and the number of passengers in these aircraft. For stability, we want to stick as closely as possible to the initial plan. We suggest solution procedures for finding two extreme ends of the nondominated objective vectors, all extreme supported nondominated objective vectors, and all nondominated objective vectors with respect to our efficiency and stability measures. An optimal decomposition rule is presented to simplify the complexity of the solution. Our extensive experiments have shown that our optimization procedures can handle the instances with up to 150 aircraft and 40 gates, and approximation algorithms can handle the instances with up to 200 aircraft and 40 gates.

Subject Keywords

Airport gate reassignment problem, Mixed integer linear programming, Nondominated objective vectors

URI

https://www.sciencedirect.com/science/article/pii/S0969699723001722?via%3Dihub
https://hdl.handle.net/11511/108117

Collections

Department of Industrial Engineering, Article