Fleet Assignment with Connection Dependent Ground Times

  • Sven Grothklags
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2832)


Given a flight schedule, which consists of a set of flights with specified departure and arrival times, a set of aircraft types and a set of restrictions, the airline fleet assignment problem (FAP) is to determine which aircraft type should fly each flight. As the FAP is only one step in a sequence of several optimization problems, important restrictions of later steps should also be considered in the FAP. This paper shows how one type of these restrictions, connection dependent ground times, can be added to the fleet assignment problem and presents three optimization methods that can solve real-world problem instances with more than 6000 legs within minutes.


Bipartite Graph Hill Climbing Complete Match Aircraft Type Planning Interval 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abara, J.: Applying integer linear programming to the fleet assignment problem. Interfaces 19(4), 20–28 (1989)CrossRefGoogle Scholar
  2. 2.
    Barnhart, C., Boland, N.L., Clarke, L.W., Shenoi, R.G.: Flight strings models for aircraft fleeting and routing. Technical report, MIT Cambridge (1997)Google Scholar
  3. 3.
    Belanger, N., Desaulniers, G., Soumis, F., Desrosiers, J., Lavigne, J.: Airline fleet assignment with homogeneity. Technical report, GERAD, Montréal (2002)Google Scholar
  4. 4.
    Berge, M.A., Hopperstad, C.A.: Demand driven dispatch: A method for dynamic aircraft capacity assignment, models and algorithms. Operations Research 41(1), 153–168 (1993)MATHCrossRefGoogle Scholar
  5. 5.
    Clarke, L.W., Hane, C.A., Johnson, E.L., Nemhauser, G.L.: Maintenance and crew considerations in fleet assignment. Technical report (1994)Google Scholar
  6. 6.
    Desaulniers, G., Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Daily aircraft routing and scheduling. Management Science 43(6), 841–855 (1997)MATHCrossRefGoogle Scholar
  7. 7.
    Gertsbach, I., Gurevich, Y.U.: Constructing an optimal fleet for a transportation schedule. Transportation Science 11(1), 20–36 (1977)CrossRefGoogle Scholar
  8. 8.
    Götz, S., Grothklags, S., Kliewer, G., Tschöke, S.: Solving the weekly fleet assignment problem for large airlines. In: MIC 1999, pp. 241 – 246 (1999)Google Scholar
  9. 9.
    Gu, Z., Johnson, E.L., Nemhauser, G.L., Wang, Y.: Some properties of the fleet assignment problem. Operations Research Letters 15, 59–71 (1994)MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Hane, C.A., Barnhart, C., Johnson, E.L., Marsten, R.E., Nemhauser, G.L., Sigismondi, G.: The fleet assignment problem: solving a large-scale integer program. Mathematical Programming 70, 211–232 (1995)MathSciNetMATHGoogle Scholar
  11. 11.
    Kniker, T.S., Barnhart, C.: Shortcomings of the conventional fleet assignment model. Technical report, MIT Cambridge (1998)Google Scholar
  12. 12.
    Osman, I.H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41, 421–451 (1993)MATHCrossRefGoogle Scholar
  13. 13.
    Radicke, U.-D.: Algorithmen für das Fleet Assignment von Flugplänen. Verlag Shaker, Aachen (1994)Google Scholar
  14. 14.
    Rushmeier, R.A., Kontogiorgis, S.A.: Advances in the optimization of airline fleet assignment. Transportation Science 31(2), 159–169 (1997)MATHCrossRefGoogle Scholar
  15. 15.
    Sharma, D., Ahuja, R.K., Orlin, J.B.: Neighborhood search algorithms for the combined through-fleet assignment model. Talk at ISMP 2000 (2000)Google Scholar
  16. 16.
    Sosnowska, D.: Optimization of a simplified fleet assignment problem with metaheuristics: Simulated annealing and GRASP. In: Pardalos, P.M. (ed.) Approximation and Complexity in Numerical Optimization. Kluwer Academic Publisher, Dordrecht (2000)Google Scholar
  17. 17.
    Subramanian, R., Sheff, R.P., Quillinan, J.D., Wiper, D.S., Marsten, R.E.: Coldstart: Fleet assignment at Delta Air Lines. Interfaces 24(1), 104–120 (1994)CrossRefGoogle Scholar
  18. 18.
    Talluri, K.T.: Swapping applications in a daily airline fleet assignment. Transportation Science 30(3), 237–248 (1996)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Sven Grothklags
    • 1
  1. 1.Department of Computer ScienceUniversity of PaderbornPaderbornGermany

Personalised recommendations