Skip to main content
SpringerLink
Log in

The Aircraft Sequencing Problem

  • Chapter
  • First Online:
Computer Science in Perspective

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2598))

Abstract

In this paper we present different exact and heuristic optimization methods for scheduling planes which want to land (and start) at an airport - the Aircraft Sequencing Problem (ASP). We compare two known integer programming formulations with four new exact and heuristic solution methods regarding quality, speed and flexibility.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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. A. Andreussi, L. Bianco, and S. Ricciardelli. A simulation model for aircraft sequencing in the near terminal area. European Journal of Operational Research, 8:345–354, 1981.

    Article  Google Scholar 

  2. J.E. Beasley. Obtaining test problems via internet. Journal of Global Optimization, 8:429–433, 1996.

    Article  MATH  Google Scholar 

  3. J.E. Beasley, M. Krishnamoorthy, Y.M. Sharaiha, and D. Abramson. The displacement problem and dynamically scheduling aircraft landings. to appear.

    Google Scholar 

  4. J.E. Beasley, M. Krishnamoorthy, Y.M. Sharaiha, and D. Abramson. Scheduling aircraft landings-the static case. Transportation Science, 34:180–197, 2000.

    Article  MATH  Google Scholar 

  5. L. Bianco, S. Ricciardelli, G. Rinaldi, and A. Sassano. Scheduling tasks with sequence dependent processing times. Naval Research Logistics, 35:177–184, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  6. R.G. Dear and Y.S. Sherif. The dynamic scheduling of aircraft in high density terminal areas. Microelectronics and Reliability, 29:743–749, 1989.

    Article  Google Scholar 

  7. A.T. Ernst, M. Krishnamoorthy, and R.H. Storer. Heuristic and exact algorithms for scheduling aircraft landings. Networks, 34:229–241, 1999.

    Article  MATH  Google Scholar 

  8. R. Feldmann, B. Monien, and S. Schamberger. A distributed algorithm to evaluate quantified boolean formulae. In Proc. of the 17th National Conference on Artificial Intelligence (AAAI-2000), pages 285–290, 2000.

    Google Scholar 

  9. J. Milan. The flow management problem in air traffic control: A model of assigning priorities for landings at a congested airport. Transportation, Planning and Technology, 20:131–162, 1997.

    Article  Google Scholar 

  10. H.N. Psaraftis. A dynamic programming approach to the aircraft sequencing problem. Research report R78-4, Flight Transportation Laboratory, MIT, 1978.

    Google Scholar 

  11. H.N. Psaraftis. A dynamic programming approach for sequencing groups of identical jobs. Operations Research, 28:1347–1359, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  12. C.S. Venkatakrishnan, A. Barnett, and A.R. Odoni. Landings at Logan Airport: Describing and increasing airport capacity. Transportation Science, 27, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Paderborn, Fürstenallee 11, 33102, Paderborn, Germany

    Torsten Fahle, Rainer Feldmann, Silvia Götz, Sven Grothklags & Burkhard Monien

Authors
  1. Torsten Fahle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rainer Feldmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Silvia Götz
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sven Grothklags
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Burkhard Monien
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Bonn, Informatik I, Römerstraße 164, 53117, Bonn, Germany

    Rolf Klein

  2. Praktische Informatik III, FernUniversität Hagen, Informatikzentrum Universitätsstraße 1, 58084, Hagen, Germany

    Hans-Werner Six

  3. Praktische Informatik - Datenbanken, Universität Kassel, 34109, Kassel, Germany

    Lutz Wegner

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Fahle, T., Feldmann, R., Götz, S., Grothklags, S., Monien, B. (2003). The Aircraft Sequencing Problem. In: Klein, R., Six, HW., Wegner, L. (eds) Computer Science in Perspective. Lecture Notes in Computer Science, vol 2598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36477-3_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-36477-3_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00579-7

  • Online ISBN: 978-3-540-36477-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation