Abstract 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.
Highlights We propose an airport gate reassignment model under gate disruptions. We define efficiency and stability measures for our different objectives. We use hierarchical optimization to handle our multi-objectives. Our procedures generate extreme supported and all nondominated objective vectors. Extensive experiments show proposed models and procedures perform satisfactorily.
An airport gate reassignment problem with gate closures
2023-12-13
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Airport gate reassignment following temporary airport closures
Taylor & Francis Verlag | 2009
|Genetic Algorithm Approach to Aircraft Gate Reassignment Problem
British Library Online Contents | 1999
|TECHNICAL PAPERS - Genetic Algorithm Approach to Aircraft Gate Reassignment Problem
Online Contents | 1999
|Taylor & Francis Verlag | 2023
|