The fleet assignment problem: solving a large-scale integer program
Mathematical Programming: Series A and B
Daily aircraft routing and scheduling
Management Science
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
Flight String Models for Aircraft Fleeting and Routing
Transportation Science
Revenue Management: Research Overview and Prospects
Transportation Science
Airline Fleet Assignment with Time Windows
Transportation Science
Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
Transportation Science
Itinerary-Based Airline Fleet Assignment
Transportation Science
Airline fleet assignment and schedule design: integrated models and algorithms
Airline fleet assignment and schedule design: integrated models and algorithms
Applications of Operations Research in the Air Transport Industry
Transportation Science
Fleeting with Passenger and Cargo Origin-Destination Booking Control
Transportation Science
Airline planning benchmark problems-Part I
Computers and Operations Research
Hi-index | 0.00 |
The airline fleet assignment problem addresses the question of how to best assign aircraft fleet types to scheduled flight legs. This paper presents the subnetwork fleet assignment model: a model that employs composite decision variables representing the simultaneous assignment of fleet types to subnetworks of one or more flight legs. The formulation is motivated by the need to better model the revenue side of the objective function. We present a solution method designed to balance revenue approximation and model tractability. Computational results suggest that the approach yields profit improvements over comparable models and that it is computationally tractable for problems of practical size.