Skip to main content

Tail Assignment in Practice

  • Conference paper
Operations Research Proceedings 2004

Part of the book series: Operations Research Proceedings ((ORP,volume 2004))

  • 6744 Accesses

Abstract

Tail Assignment is the problem of assigning specific aircraft to flights, producing a fully operational, robust schedule which fulfills operational constraints, while minimizing a cost function. The costs are usually related to robustness and quality of the solution, e.g. to penalize short times between flights and reward “crew-friendly” connections. Carmen Systems’ Tail Assignment system utilizes a combination of optimization methods and constraint programming to solve this problem. An interesting aspect of the system is that it can solve several fleet types at once, moving towards an integration of the traditional two-step approach of first solving the Fleet Assignment problem and then Tail Assignment. The article intends to explain some of the methods used.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Grönkvist M. (2003) Tail Assignment-A Combined Column Generation and Constraint Programming Approach. Lic. Thesis, Chalmers University of Technology, Gothenburg

    Google Scholar 

  2. Dantzig G. B., Wolfe P. (1961) The Decomposition Algorithm for Linear Programs. Econometrica. 29(4):767–778

    MathSciNet  Google Scholar 

  3. Carmen Systems AB. http://www.carmensystems.com

    Google Scholar 

  4. Kjerrström J. (2003) A Model and Application of the Resource Constrained Shortest Path Problem with Reset Possibilities. Master’s Thesis, Chalmers University of Technology, Gothenburg

    Google Scholar 

  5. Kilborn E. (2000) Aircraft Scheduling and Operation-A Constraint Programming Approach, Master’s Thesis, Chalmers University of Technology, Gothenburg

    Google Scholar 

  6. Ahuja R.K., Magnanti T.L. and Orlin J.B. (1993) Network Flows. Prentice Hall, New Jersey

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grönkvist, M., Kjerrström, J. (2005). Tail Assignment in Practice. In: Fleuren, H., den Hertog, D., Kort, P. (eds) Operations Research Proceedings 2004. Operations Research Proceedings, vol 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27679-3_21

Download citation

Publish with us

Policies and ethics