Flight gate assignment and recovery strategies with stochastic arrival and departure times

• Published in: OR Spectrum Vol. 39; no. 1; pp. 65 - 93
• Main Authors: Dorndorf, Ulrich, Jaehn, Florian, Pesch, Erwin
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer Berlin Heidelberg 2017; Springer Nature B.V
• Subjects: Aircraft; Airline scheduling; Airports; Arrivals; Assignment problem; Aviation; Business and Management; Calculus of Variations and Optimal Control; Optimization; Fuzzy sets; Gates; Mathematical models; Minimization; Operations research; Operations Research/Decision Theory; Regular Article; Scheduling; Stochasticity; Strategy; Studies; Violations; Gate assignment; Robustness; Clique partitioning
• ISSN: 0171-6468; 1436-6304
• DOI: 10.1007/s00291-016-0443-1

We consider the problem of assigning flights to airport gates. We examine the general case in which an aircraft serving a flight may be assigned to different gates for arrival, parking, and departure processing. The objectives can be divided into deterministic and stochastic goals. The former include maximization of the total assignment preference score, a minimal number of unassigned flights during overload periods, and minimization of the number of tows. A special focus lies on the stochastic objectives, which aim at minimizing the expected number of any kind of constraint violations, i.e. not respecting gate closures, violation of shadow restrictions (a situation in which gate assignments may cause blocking of neighboring gates) or of tow time restrictions and classical gate conflicts in which two aircraft are assigned to the same gate and are at the airport at the same time. We show that the minimization of expected gate conflicts can be modeled in a graph theoretical approach using the clique partitioning problem (CPP). We furthermore show that the classical (deterministic) flight gate assignment problem, which can also be modeled using a CPP, can be integrated such that a simple though powerful model emerges, which no longer needs including a dummy gate, which is often used in practical gate assignment models. As constraint violations cannot fully be prevented, recovery strategies become necessary. We present a procedure for recovery planning that has proved its practical relevance at numerous airports. Finally, in an extensive numerical study we test our results on practical data, which contain a statistical analysis of flight arrival and departure times. The tests include a detailed comparison of current robustness measures and state-of-the-art approaches found in literature.