Abstract
This paper describes recent research into the departure process at London Heathrow, with the primary motivation of reducing the amount of fuel used, improving both the economic and environmental costs. Two proposals are considered here. The first proposal considers the practicality and potential benefits of aiding the controller in improving the take-off sequencing. The second proposal aims to absorb some of the inevitable delay for aircraft at the stands, before the engines are started, but also involves a take-off sequencing aspect. Models for the two take-off sequencing problems are presented in this paper, the second of which includes an additional pushback time (or TSAT) allocation sub-problem which has to be solved subsequently. These models have distinctive differences from the models for the take-off and arrival sequencing problems which are usually considered in the literature, since they take into account necessary constraints imposed due to the control problem (whether a sequence can actually be achieved, and how) in each case. As discussed in this paper, the control problem cannot be ignored by the controllers at Heathrow, and so it cannot be ignored by any realistic system to aid them in their tasks. Comparative take-off sequencing results are presented for the two systems, and the potential benefits from providing decision support to the runway controllers or improved TSAT allocation at the stands are considered. The paper ends with some overall conclusions from the research, showing the large potential benefits of these systems. The TSAT allocation system which is discussed in this paper has been developed for implementation at London Heathrow as one element of a major project which focuses upon collaborative decision making.
Similar content being viewed by others
References
Anagnostakis, I., & Clarke, J.-P. (2002). Runway operations planning, a two-stage heuristic algorithm. In Proceedings of the AIAA aircraft, technology, integration and operations forum, Los Angeles, CA, report AIAA-2002-5886.
Anagnostakis, I., & Clarke, J.-P. (2003). Runway operations planning: a two-stage solution methodology. In Proceedings of the 36th Hawaii international conference on system sciences (HICSS-36), Hawaii (Vol. 3).
Atkin, J. A. D. (2008). On-line decision support for take-off runway scheduling at London Heathrow airport. Ph.D. thesis, The University of Nottingham.
Atkin, J. A. D., Burke, E. K., Greenwood, J. S., & Reeson, D. (2006). The effect of the planning horizon and freezing time on take-off sequencing. In Proceedings of the 2nd international conference on research in air transportation (ICRAT), Belgrade, Serbia and Montenegro.
Atkin, J. A. D., Burke, E. K., Greenwood, J. S., & Reeson, D. (2007). Hybrid meta-heuristics to aid runway scheduling at London Heathrow airport. Transportation Science, 41(1), 90–106.
Atkin, J. A. D., Burke, E. K., Greenwood, J. S., & Reeson, D. (2008a). A meta-heuristic approach to aircraft departure scheduling at London Heathrow airport. In M. Hickman, P. Mirchandani, & S. Voss (Eds.), Lecture notes in economics and mathematical systems. Computer aided systems of public transport. Berlin: Springer.
Atkin, J. A. D., Burke, E. K., Greenwood, J. S., & Reeson, D. (2008b). On-line decision support for take-off runway scheduling with uncertain taxi times at London Heathrow airport. The. Journal of Scheduling, 11(5), 323–346.
Atkin, J. A. D., Burke, E. K., Greenwood, J. S., & Reeson, D. (2009). An examination of take-off scheduling constraints at London Heathrow airport. Public Transport, 1(3), 169–187.
Atkin, J. A. D., Burke, E. K., & Greenwood, J. S. (2010). The TSAT allocation system at London Heathrow: the relationship between slot compliance, throughput and equity. Public Transport, 2(3), 173–198.
Beasley, J. E., Krishnamoorthy, M., Sharaiha, Y. M., & Abramson, D. (2000). Scheduling aircraft landings—the static case. Transportation Science, 34, 180–197.
Beasley, J. E., Krishnamoorthy, M., Sharaiha, Y. M., & Abramson, D. (2004). Displacement problem and dynamically scheduling aircraft landings. Journal of the Operational Research Society, 55(1), 54–64.
Bolender, M. A., & Slater, G. L. (2000). Analysis and optimization of departure sequences. In Proceedings of the AIAA guidance, navigation and control conference and exhibit, Denver, CO (pp. 1672–1683).
Dear, R. G., & Sherif, Y. S. (1991). An algorithm for computer assisted sequencing and scheduling of terminal area operations. Transportation Research Part A, Policy and Practice 25, 129–128.
Ernst, A. T., Krishnamoorthy, M., & Storer, R. H. (1999). Heuristic and exact algorithms for scheduling aircraft landings. Networks, 34, 229–241.
Idris, H. R., Clarke, J.-P., Bhuva, R., & Kang, L. (2002). Queuing model for taxi-out time estimation. Air Traffic Control Quarterly (ATCA Publications), 10(1), 1–22.
Pinol, H., & Beasley, J. (2006). Scatter search and bionomic algorithms for the aircraft landing problem. European Journal of Operational Research, 171, 439–462.
Psaraftis, H. N. (1980). A dynamic programming approach for sequencing groups of identical jobs. Operations Research, 28(6), 1347–1359.
Trivizas, D. A. (1998). Optimal scheduling with maximum position shift (MPS) constraints: a runway scheduling application. Journal of Navigation, 51, 250–266.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Atkin, J.A.D., Burke, E.K. & Greenwood, J.S. A comparison of two methods for reducing take-off delay at London Heathrow airport. J Sched 14, 409–421 (2011). https://doi.org/10.1007/s10951-011-0228-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-011-0228-y