Addressing the Pushback Time Allocation Problem at Heathrow Airport

This paper considers the problem of allocating pushback times to departing aircraft, specifying the time at which they will be given permission to push back from their allocated stand, start their engines, and commence their taxi to the runway. The aim of this research is to first predict the delay (defined as the waiting time at the stand or runway) for each departure, then to use this to calculate a pushback time such that an appropriate amount of the delay is absorbed at the stand, prior to starting the engines. A two-stage approach is used, where the feasibility of the second stage (pushback time allocation) has to be considered within the first stage (takeoff sequencing). The characteristics of this real-world problem and the differences between it and similar problems are thoroughly discussed, along with a consideration of the important effects of these differences. Differences include a nonlinear objective function with a nonconvex component; the integration of two sequence dependent separation problems; separations that can vary over time; and time-slot extensions. Each of these factors has contributed to the design of the solution algorithm. Results predict significant fuel-burn benefits from absorbing some of the delay as stand hold, as well as delay benefits from indirectly aiding the runway controllers by reducing runway queue sizes. A system for pushback time allocation at London Heathrow has been developed by NATS (formerly National Air Traffic Services) based upon the algorithm described in this paper.

[1]  Lucio Bianco,et al.  The traveling salesman problem with cumulative costs , 1993, Networks.

[2]  Edmund K. Burke,et al.  A comparison of two methods for reducing take-off delay at London Heathrow airport , 2011, J. Sched..

[3]  David Abramson,et al.  Scheduling Aircraft Landings - The Static Case , 2000, Transp. Sci..

[4]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Approach for Sequencing Groups of Identical Jobs , 1980, Oper. Res..

[5]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[6]  Edmund K. Burke,et al.  An examination of take-off scheduling constraints at London Heathrow airport , 2009, Public Transp..

[7]  Yosef S. Sherif,et al.  The dynamic scheduling of aircraft in high density terminal areas , 1989 .

[8]  Sophie Boyd Public transport-1 , 2013 .

[9]  C. Brinton,et al.  Collaborative Departure Queue Management An Example of Airport Collaborative Decision Making in the United States , 2011 .

[10]  Hamsa Balakrishnan,et al.  Algorithms for Scheduling Runway Operations Under Constrained Position Shifting , 2010, Oper. Res..

[11]  John-Paul Clarke,et al.  Observations of Departure Processes at Logan Airport to Support the Development of Departure Planning Tools , 1999 .

[12]  Edmund K. Burke,et al.  A combined statistical approach and ground movement model for improving taxi time estimations at airports , 2013, J. Oper. Res. Soc..

[13]  Edmund K. Burke,et al.  Hybrid Metaheuristics to Aid Runway Scheduling at London Heathrow Airport , 2007, Transp. Sci..

[14]  Edmund K. Burke,et al.  TSAT allocation at London Heathrow: the relationship between slot compliance, throughput and equity , 2010, Public Transp..

[15]  Yosef S. Sherif,et al.  AN ALGORITHM FOR COMPUTER ASSISTED SEQUENCING AND SCHEDULING OF TERMINAL AREA OPERATIONS , 1991 .

[16]  John-Paul Clarke,et al.  Queuing Model for Taxi-Out Time Estimation , 2002 .

[17]  Nicolas Durand,et al.  Airport surface management and runways scheduling , 2009 .

[18]  Jason Adam David Atkin,et al.  On-line decision support for take-off runaway scheduling at London Heathrow Airport , 2008 .

[19]  Edmund K. Burke,et al.  The Airport Ground Movement Problem: Past and Current Research and Future Directions , 2010 .

[20]  Lucio Bianco,et al.  Minimizing total completion time subject to release dates and sequence‐dependentprocessing times , 1999, Ann. Oper. Res..