CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Combining column generation and constraint programming to solve the tail assignment problem

S. Gabteni ; Mattias Grönkvist (Institutionen för data- och informationsteknik, Datavetenskap (Chalmers))
Annals of Operations Research (0254-5330). Vol. 171 (2009), 1, p. 61-76.
[Artikel, refereegranskad vetenskaplig]

Within the area of short term airline operational planning, Tail Assignment is the problem of assigning flight legs to individual identified aircraft while satisfying all operational constraints, and optimizing some objective function. In this article, we propose that Tail Assignment should be solved as part of both the short and the long term airline planning. We further present a hybrid column generation and constraint programming solution approach. This approach can be used to quickly produce solutions for operations management, and also to produce close-to-optimal solutions for long and mid term planning scenarios. We present computational results which illustrate the practical usefulness of the approach.

Nyckelord: Airline operational planning, Tail assignment, Fleet planning, Column, generation, Constraint programming, maintenance routing problem, aircraft, model

Denna post skapades 2010-02-26.
CPL Pubid: 115356


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Datavetenskap (Chalmers)


Datavetenskap (datalogi)

Chalmers infrastruktur