Skip to main content

Aircraft Sequencing Problems via a Rolling Horizon Algorithm

  • Conference paper
Combinatorial Optimization (ISCO 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7422))

Included in the following conference series:

Abstract

Aircraft sequencing on the runway is a challenging optimization problem that aims to reduce the delays and the air traffic controllers workload in a scenario characterized by a continuous growth of the air transportation demand. In this paper we consider the problem of sequencing both arrivals and departures on a single runway airport. We formalize the problem using a Mixed Integer Programming Model and we propose a rolling horizon solution approach. Computational results on real-world air traffic instances from the Milano Linate Airport are reported. The results show that the proposed approach is able to significantly improve on the First Come First Served (FCFS) sequence.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ernst, A.T., Krishnamoorthy, M., Storer, R.H.: Heuristic and exact algorithm for scheduling aircraft landing. Networks 34, 229–241 (1999)

    Article  MATH  Google Scholar 

  2. Brentnall, A.R.: Aircraft Arrivals Management. Dissertation Thesis, University of Southhampton (2006)

    Google Scholar 

  3. Persiani, C.A., Bagassi, S.: Integration of AMAN and DMAN using Particle Swarm Optimization. In: Electronic Proceedings of the 3rd CEAS AirSpace Conference (2011)

    Google Scholar 

  4. Cheng, V.H.L., Crawford, L.S., Menon, P.K.: Air traffic control using genetic search techniques. In: IEEE International Conference on Control Applications (1999)

    Google Scholar 

  5. Abela, J., Abramson, D., Krishnamoorthy, M., De Silva, A., Mills, G.: Computing optimal schedules for landing aircraft. In: Proceeding 12th National ASOR Conference, Adelaide, Australia, pp. 71–90 (1993)

    Google Scholar 

  6. Bennel, J.A., Mesgarpour, M., Potts, C.N.: Airport Runway Scheduling. 4OR 9, 115–138 (2011)

    Article  MathSciNet  Google Scholar 

  7. Atkin, J.A.D., Burke, E.K., Greenwood, J.S., Reeson, D.: An examination of take-off scheduling constraints at London Heathrow airport. In: Electronic Proceedings of the 9th Conference of Computer-Aided Scheduling of Pubblic Transport, CASPT 2006 (2006)

    Google Scholar 

  8. Atkin, J.A.D., Burke, E.K., Greenwood, J.S., Reeson, D.: A metaheuristic approach to aircraft departure scheduling at London Heathrow airport. In: Electronic Proceedings of the 9th Conference of Computer-Aided Scheduling of Pubblic Transport, San Diego, USA (2004)

    Google Scholar 

  9. Atkin, J.A.D., Burke, E.K., Greenwood, J.S., Reeson, D.: Hybrid metaheuristic to aid runway scheduling at London Heathrow airport. Transportation Science 41, 90–106 (2007)

    Article  Google Scholar 

  10. Atkin, J.A.D., Burke, E.K., Greenwood, J.S., Reeson, D.: On-line decision support for take-off runway scheduling under uncertain taxi time at London Heathrow airport. Journal of Scheduling 11, 323–346 (2007)

    Article  MathSciNet  Google Scholar 

  11. Beasley, J.E., Krishnamoorthy, M., Sharaiha, Y.M., Abramson, D.: Scheduling Aircraft landing-the static case. Transportation Science 34, 180–197 (2000)

    Article  MATH  Google Scholar 

  12. Beasley, J.E., Krishnamoorthy, M., Sharaiha, Y.M., Abramson, D.: Displacement problem and dynamically scheduling aircraft landings. Journal of the Operational Research Society 55, 54–64 (2004)

    Article  MATH  Google Scholar 

  13. Stevens, G.: An approach to scheduling aircraft landing times using genetic algorithms. Dissertation Thesis, Department of Computer Science, RMIT University, Melbourne, Australia (1995)

    Google Scholar 

  14. Ciesielski, V., Scerri, P.: Real Time Genetic Scheduling of Aircraft Landing Times. In: Proceeding of the 1998 IEEE International Conference on Evolutionary Computation (ICEC 1998), pp. 360–364. IEEE, New York (1998)

    Google Scholar 

  15. Beasley, J.E., Pinol, H.: Scatter Search and Bionomic Algorithms for the Aircraft Landing Problem. European Journal of Operational Research 127(2), 439–462 (2006)

    Google Scholar 

  16. Luenberger, R.A.: A travelling-salesman-based approach to aircraft scheduling in the terminal area. Technical report, NASA, tecincal memorandum 100062 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Furini, F., Persiani, C.A., Toth, P. (2012). Aircraft Sequencing Problems via a Rolling Horizon Algorithm. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds) Combinatorial Optimization. ISCO 2012. Lecture Notes in Computer Science, vol 7422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32147-4_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32147-4_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32146-7

  • Online ISBN: 978-3-642-32147-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics