Periodic Airline Fleet Assignment with Time Windows, Spacing Constraints, and Time Dependent Revenues

, , , and

BibTeX reference

Given the sets of flights and aircraft of an airline carrier, the fleet assignment problem consists of assigning the most profitable aircraft type to each flight. In this paper we propose a model for the periodic fleet assignment problem with time windows in which departure times are also determined. Anticipated profits depend on the schedule and the selection of aircraft types. In addition, short spacings between consecutive flights which serve the same origin-destination pair of airports are penalized. We propose a non-linear integer multi-commodity network flow formulation. We develop new branch-and-bound strategies which are embedded in our branch-and-price solution strategy. Finally, we present computational results for periodic daily schedules on three real-world data sets.

, 26 pages

This cahier was revised in May 2005

Research Axis

Research application


Periodic airline fleet assignment with time windows, spacing donstraints, and time dependent revenues
, , , and
European Journal of Operational Research, 175(3), 1754–1766, 2006 BibTeX reference