Abstract
Abstract Fleet assignment is one of the four major steps in airline planning. The objective of the fleet assignment problem (FAP) is to determine which type of aircraft should fly on each flight leg while considering different characteristics and costs associated with different fleet types. This article proposes a multiphase approach to solving the FAP. Backward arcs were used to solve basic FAPs. Then the backward arcs were eliminated by using linear programming. By allowing backward time, our formulation has a similar level of flexibility as the fleet assignment model with time-window (FAMTW), but the problem size grows much slower than FAMTW. Examples using real data obtained from a major airline are included in this article.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
