Abstract
Given a flight schedule and set of aircraft, the fleet assignment problem is to determine which type of aircraft should fly each flight segment. This paper describes a basic daily, domestic fleet assignment problem and then presents chronologically the steps taken to solve it efficiently. Our model of the fleet assignment problem is a large multi-commodity flow problem with side constraints defined on a time-expanded network. These problems are often severely degenerate, which leads to poor performance of standard linear programming techniques. Also, the large number of integer variables can make finding optimal integer solutions difficult and time-consuming. The methods used to attack this problem include an interior-point algorithm, dual steepest edge simplex, cost perturbation, model aggregation, branching on set-partitioning constraints and prioritizing the order of branching. The computational results show that the algorithm finds solutions with a maximum optimality gap of 0.02% and is more than two orders of magnitude faster than using default options of a standard LP-based branch-and-bound code.
Similar content being viewed by others
References
J. Abara, “Applying integer linear programming to the fleet assignment problem,”Interfaces 19 (1989) 20–28.
M.A. Berge and C.A. Hopperstad, “Demand driven dispatch: a method for dynamic aircraft capacity assignment, models and algorithms,”Operations Research 41 (1993) 153–168.
L.W. Clarke, C.A. Hane, E.L. Johnson and G.L. Nemhauser, “Modeling issues in fleet assignment,”Transportation Science, to appear.
J. Druckerman, D. Silverman and K. Viaropulos,IBM Optimization Subroutine Library, Guide and Reference, Release 2, Document Number SC230519-02, IBM, Kingston, NY (1991).
J.J. Forrest and D. Goldfarb, “Steepest-edge simplex algorithms for linear programming,”Mathematical Programming 57 (3) (1992) 341–374.
J.J.H. Forrest and J.A. Tomlin, “Implementing the simplex method of the Optimization Subroutine Library,”IBM Systems Journal 31 (1992) 11–25.
J.J.H. Forrest and J.A. Tomlin, “Implementing interior point linear programming methods in the Optimization Subroutine Library,”IBM Systems Journal 31 (1992) 26–38.
D. Goldfarb and J.K. Reid, “A practicable steepest-edge simplex algorithm,”Mathematical Programming 12 (3) (1977) 361–371.
P.M.J. Harris, “Pivot selection methods of the Devex LP code,”Mathematical Programming 5 (1) (1973) 1–28; reprinted in:Mathematical Programming Study 4 (1975) 30–57.
I.J. Lustig, R.E. Marsten and D.F. Shanno, “On implementing Mehrotra's predictor—corrector interior point method for linear programming,”SIAM Journal on Optimization 2 (1992) 435–449.
N. Megiddo, “On finding primal- and dual-optimal bases,”ORSA Journal on Computing 3 (1991) 63–65.
S. Mehrotra, “On the implementation of a primal—dual interior point method,”SIAM Journal on Optimization 2 (1992) 575–601.
Author information
Authors and Affiliations
Additional information
This work was supported by NSF and AFORS grant DDM-9115768 and NSF grant SES-9122674.
Corresponding author.
Rights and permissions
About this article
Cite this article
Hane, C.A., Barnhart, C., Johnson, E.L. et al. The fleet assignment problem: Solving a large-scale integer program. Mathematical Programming 70, 211–232 (1995). https://doi.org/10.1007/BF01585938
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01585938