Flight String Models for Aircraft Fleeting and Routing
- 1 August 1998
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 32 (3), 208-220
- https://doi.org/10.1287/trsc.32.3.208
Abstract
Given a schedule of flight legs to be flown by an airline, the fleet assignment problem is to determine the minimum cost assignment of flights to aircraft types, called fleets, such that each scheduled flight is assigned to exactly one fleet, and the resulting assignment is feasible to fly given a limited number of aircraft in each fleet. Then the airline must determine a sequence of flights, or routes, to be flown by individual aircraft such that assigned flights are included in exactly one route, and all aircraft can be maintained as necessary. This is referred to as the aircraft routing problem. In this paper, we present a single model and solution approach to solve simultaneously the fleet assignment and aircraft routing problems. Our approach is robust in that it can capture costs associated with aircraft connections and complicating constraints such as maintenance requirements. By setting the number of fleets to one, our approach can be used to solve the aircraft routing problem alone. We show how to extend our model and solution approach to solve aircraft routing problems with additional constraints requiring equal aircraft utilization. With data provided by airlines, we provide computational results for the combined fleet assignment and aircraft routing problems without equal utilization requirements and for aircraft routing problems requiring equal aircraft utilizationKeywords
This publication has 9 references indexed in Scilit:
- The aircraft rotation problemAnnals of Operations Research, 1997
- Maintenance and Crew Considerations in Fleet AssignmentTransportation Science, 1996
- Swapping Applications in a Daily Airline Fleet AssignmentTransportation Science, 1996
- The fleet assignment problem: Solving a large-scale integer programMathematical Programming, 1995
- Chapter 2 Time constrained routing and schedulingPublished by Elsevier BV ,1995
- MINTO, a mixed INTeger optimizerOperations Research Letters, 1994
- A polyhedral approach to edge coloringOperations Research Letters, 1991
- Flight Scheduling and Maintenance Base PlanningManagement Science, 1989
- Applying Integer Linear Programming to the Fleet Assignment ProblemInforms Journal on Applied Analytics, 1989