Title
Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues
Abstract
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.
Year
DOI
Venue
2006
10.1016/j.ejor.2004.04.051
European Journal of Operational Research
Keywords
Field
DocType
Integer programming,Dantzig–Wolfe decomposition,Column generation,Routing,Scheduling,Airline fleet assignment
Flow network,Dantzig–Wolfe decomposition,Column generation,Mathematical optimization,Scheduling (computing),Aviation,Operations research,Assignment problem,Schedule,Integer programming,Operations management,Mathematics
Journal
Volume
Issue
ISSN
175
3
0377-2217
Citations 
PageRank 
References 
10
0.76
9
Authors
4
Name
Order
Citations
PageRank
Nicolas Bélanger1518.16
Guy Desaulniers287462.90
François Soumis382197.64
Jacques Desrosiers41188.75