Abstract
This paper considers 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 and departure processing and for optional intermediate parking. Restrictions to this assignment include gate closures and shadow restrictions, i.e., the situation where certain gate assignments may cause blocking of neighboring gates. The objectives include maximization of the total assignment preference score, a minimal number of unassigned flights during overload periods, minimization of the number of tows, maximization of a robustness measure as well as a minimal deviation from a given reference schedule. We show that in case of a one period time horizon this objective can easily be integrated into our existing model based on the Clique Partitioning Problem. Furthermore we present a heuristic algorithm to solve the problem for multiple periods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Babic, O., Teodorovic, D., & Tosic, V. (1984). Aircraft stand assignment to minimize walking. Journal of Transportation Engineering, 110, 55–66.
Bihr, R. A. (1990). A conceptual solution to the aircraft gate assignment problem using, 0, 1 linear programming. Computers and Industrial Engineering, 19, 280–284.
Bolat, A. (2000). Procedures for providing robust gate assignments for arriving aircraft. European Journal of Operations Research, 120, 63–80.
Braaksma, J. P. (1977). Reducing walking distance at existing airports. Airport Forum, 4, 135–142.
Burke, E., & Petrovic, S. (2002). Recent research directions in automated timetabling. European Journal of Operational Research, 140, 266–280.
Ding, H., Lim, A., Rodrigues, B., & Zhu, Y. (2004). New heuristics for the overconstrained airport gate assignment problem. Journal of the Operational Research Society, 55, 760–768.
Dorndorf, U. (2002). Project scheduling with time windows: from theory to applications. Heidelberg: Physica.
Dorndorf, U., & Pesch, E. (1994). Fast clustering algorithms. ORSA Journal on Computing, 6, 141–153.
Dorndorf, U., Drexl, A., Nikulin, Y., & Pesch, E. (2007a). Flight gate scheduling: state-of-the-art and recent developments. Omega, 35, 326–334.
Dorndorf, U., Jaehn, F., Lin, C., Ma, H., & Pesch, E. (2007b). Disruption management in flight gate scheduling. Statistica Neerlandica, 61, 92–114.
Dorndorf, U., Jaehn, F., & Pesch, E. (2008). Modelling robust flight gate scheduling as a clique partitioning problem. Transportation Science, 42, 292–301.
Drexl, A., & Nikulin, Y. (2006). Fuzzy multicriteria flight gate assignment (Working paper no. 605). University of Kiel.
Drexl, A., & Nikulin, Y. (2008). Multicriteria airport gate assignment and pareto simulated annealing. IIE Transactions, 40, 385–397.
Drexl, A., & Nikulin, Y. (2010). Theoretical aspects of multicriteria flight gate scheduling: deterministic and fuzzy models. Journal of Scheduling, 13, 261–280.
Dyer, M., & Frieze, A. (1985). On the complexity of partitioning graphs into connected subgraphs. Discrete Applied Mathematics, 10, 139–153.
Hassounah, M., & Steuart, G. (1993). Demand for aircraft gates. Transportation Research Record, 1423, 26–33.
Jaehn, F. (2010). Solving the flight gate assignment problem using dynamic programming. Zeitschrift für Betriebswirtschaft, 80, 1027–1039.
Lim, A., & Wang, F. (2005). Robust airport gate assignment. In ICTAI ’05: Proceedings of the 17th IEEE international conference on tools with artificial intelligence (pp. 74–81). Washington: IEEE Computer Society.
Mangoubi, R. S., & Mathaisel, D. F. X. (1985). Optimizing gate assignment at airport terminals. Transportation Science, 19, 173–188.
Nikulin, Y. (2006). Robustness in combinatorial optimization and scheduling theory: An extended annotated bibliography (Working paper no. 606). University of Kiel.
Qu, R., Burke, E., McCollum, B., Merlot, L., & Lee, S. (2009). A survey of search methodologies and automated system development for examination timetabling. Journal of Scheduling, 12, 55–89.
Scholl, A. (2001). Robuste Planung und Optimierung. Berlin: Springer.
Yan, S., & Chang, C. (1998). A network model for gate assignment. Journal of Advanced Transportation, 32, 176–189.
Yan, S., & Huo, C. (2001). Optimization of multiple objective gate assignments. Transportation Research, A, 35, 413–432.
Yan, S., & Tang, C. (2007). A heuristic approach for airport gate assignments for stochastic flight delays. European Journal of Operational Research, 180, 547–567.
Zhang, S. X., Cesarone, J., & Miller, F. (1994). A comparative study of an aircraft assignment problem at a large aircraft. International Journal of Industrial Engineering, 1, 203–212.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work has been supported by the German Science Foundation (DFG) through the grant “Planung der Bodenabfertigung an Flughäfen” (PE 514/10-1).
Rights and permissions
About this article
Cite this article
Dorndorf, U., Jaehn, F. & Pesch, E. Flight gate scheduling with respect to a reference schedule. Ann Oper Res 194, 177–187 (2012). https://doi.org/10.1007/s10479-010-0809-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-010-0809-8