Article ID: | iaor2005989 |
Country: | Netherlands |
Volume: | 44 |
Issue: | 2 |
Start Page Number: | 160 |
End Page Number: | 171 |
Publication Date: | Jul 2004 |
Journal: | Networks |
Authors: | Liu Jian, Orlin James B., Ahuja Ravindra K., Goodstein Jon, Mukherjee Amit |
Keywords: | heuristics, programming: assignment, programming: transportation |
The fleet assignment model (FAM) for an airline assigns fleet types to a set of flight legs that satisfies a variety of constraints and minimizes the cost of the assignment. The through assignment model matches inbound flight legs into a city with the outbound flight legs at the same city that are flown by the same plane types and creates through connections (that is, flight connections with one stopover). The combined through and fleet assignment model (ctFAM) integrates both the models into a single model and obtains optimal fleet and through assignments by varying both sets of decision variables simultaneously. In a recent article, Ahuja