Flight gate scheduling with respect to a reference schedule

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.

[1]  Martin E. Dyer,et al.  On the complexity of partitioning graphs into connected subgraphs , 1985, Discret. Appl. Math..

[2]  Dennis F. X. Mathaisel,et al.  Optimizing Gate Assignments at Airport Terminals , 1985, Transp. Sci..

[3]  Yi Zhu,et al.  New heuristics for over-constrained flight to gate assignments , 2004, J. Oper. Res. Soc..

[4]  Chen Lin,et al.  Disruption management in flight gate scheduling , 2007 .

[5]  Chia-Ming Chang,et al.  A network model for gate assignment , 1998 .

[6]  Andrew Lim,et al.  Robust airport gate assignment , 2005, 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05).

[7]  Yury Nikulin,et al.  Theoretical aspects of multicriteria flight gate scheduling: deterministic and fuzzy models , 2010, J. Sched..

[8]  Erwin Pesch,et al.  Modelling Robust Flight-Gate Scheduling as a Clique Partitioning Problem , 2008, Transp. Sci..

[9]  J P Braaksma.  REDUCING WALKING DISTANCES AT EXISTING AIRPORTS , 1977 .

[10]  Ulrich Dorndorf,et al.  Project Scheduling with Time Windows: From Theory to Applications , 2002 .

[11]  Yury Nikulin,et al.  Flight gate scheduling: State-of-the-art and recent developments , 2007 .

[12]  Yury Nikulin,et al.  Multicriteria airport gate assignment and Pareto simulated annealing , 2008 .

[13]  Erwin Pesch,et al.  Fast Clustering Algorithms , 1994, INFORMS J. Comput..

[14]  Gerald N. Steuart,et al.  DEMAND FOR AIRCRAFT GATES , 1993 .

[15]  Armin Scholl,et al.  Robuste Planung und Optimierung , 2001 .

[16]  Richard A. Bihr,et al.  A conceptual solution to the aircraft gate assignment problem using 0,1 linear programming , 1990 .

[17]  Yury Nikulin,et al.  Fuzzy multicriteria flight gate assignment , 2006 .

[18]  Shangyao Yan,et al.  A heuristic approach for airport gate assignments for stochastic flight delays , 2007, Eur. J. Oper. Res..

[19]  Ulrich Dorndorf,et al.  Project Scheduling with Time Windows , 2002 .

[20]  Kouji Kurihara,et al.  Optimizing Gate Assignment at Airport Terminal , 2010 .

[21]  Dušan Teodorović,et al.  Aircraft Stand Assignment to Minimize Walking , 1984 .

[22]  Edmund K. Burke,et al.  A survey of search methodologies and automated system development for examination timetabling , 2009, J. Sched..

[23]  Sanja Petrovic,et al.  Recent research directions in automated timetabling , 2002, Eur. J. Oper. Res..

[24]  Shangyao Yan,et al.  Optimization of multiple objective gate assignments , 2001 .

[25]  Ahmet Bolat,et al.  Procedures for providing robust gate assignments for arriving aircrafts , 2000, Eur. J. Oper. Res..

[26]  Yury V. Nikulin,et al.  Robustness in combinatorial optimization and scheduling theory: An extended annotated bibliography , 2004 .

[27]  Florian Jaehn,et al.  Solving the flight gate assignment problem using dynamic programming , 2010 .

[28]  Andrew Lim,et al.  The Airport Gate Assignment Problem , 2003 .