Tail Assignment in Practice

  • Grönkvist M
  • Kjerrström J
N/ACitations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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 penaHze 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.

Cite

CITATION STYLE

APA

Grönkvist, M., & Kjerrström, J. (2005). Tail Assignment in Practice (pp. 166–173). https://doi.org/10.1007/3-540-27679-3_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free