Tail Assignment in Practice

Mattias Grönkvist () and Jens Kjerrström ()
Additional contact information
Mattias Grönkvist: Carmen Systems AB
Jens Kjerrström: Carmen Systems AB

A chapter in Operations Research Proceedings 2004, 2005, pp 166-173 from Springer

Abstract: 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.

Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-27679-1_21

Ordering information: This item can be ordered from
http://www.springer.com/9783540276791

DOI: 10.1007/3-540-27679-3_21

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().