From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future

  • Sven Grothklags
  • Ulf Lorenz
  • Burkhard Monien
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5515)


Given a flight schedule, which is a set of non-stop flights, called legs, with specified departure and arrival times, and a set of aircraft types, called subfleets, the fleet assignment problem is to determine which aircraft type should fly each leg. The objective is to maximize the overall profit.

Usually, planners assume that precise input data are determininstically available at planning time. As a consequence, an important insufficiency of modern industrial plans, especially flight-plans, is their lack of robustness. Disruptions prevent from operating as planned before and induce high costs for trouble shooting.

One reason for the uncertainties in the data for fleet assignment is that this problem is part of a long row of optimization problems of an airline. Therefore, important restrictions of later steps like connection dependent ground times should be considered in the fleet assignment problem. We show how connection dependent ground times can be added to the fleet assignment problem and presents three optimization methods, varying in run time and solution quality, that can solve real-world problem instances with more than 6000 legs within minutes.

Moreover, real or believed non-determinism leads to inevitable uncertainties in input data. As a consequence, instead of a traditional plan, a flexible strategy which reacts on different relizations of the uncertain data is demanded. The Repair Game is a formalization of a planning task, and playing it performs disruption management and generates robust plans with the help of game tree search. We introduce the game and present experimental results of a feasibility study.


Mixed Integer Program Game Tree Mixed Integer Program Model Complete Match Aircraft Type 
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.
    Althöfer, I.: Root evaluation errors: How they arise and propagate. ICCA Journal 11(3), 55–63 (1988)Google Scholar
  3. 3.
    Ballard, B.W.: The *-minimax search procedure for trees containing chance nodes. Artificial Intelligence 21(3), 327–350 (1983)CrossRefMATHGoogle Scholar
  4. 4.
    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
  5. 5.
    Belanger, N., Desaulniers, G., Soumis, F., Desrosiers, J., Lavigne, J.: Airline fleet assignment with homogeneity. Technical report, GERAD, Montréal (2002)Google Scholar
  6. 6.
    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)CrossRefMATHGoogle Scholar
  7. 7.
    Clarke, L.W., Hane, C.A., Johnson, E.L., Nemhauser, G.L.: Maintenance and crew considerations in fleet assignment. Technical report (1994)Google Scholar
  8. 8.
    Desaulniers, G., Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Daily aircraft routing and scheduling. Management Science 43(6), 841–855 (1997)CrossRefMATHGoogle Scholar
  9. 9.
    Ehrhoff, J., Grothklags, S., Lorenz, U.: Das Reparaturspiel als Formalisierung von Planung unter Zufallseinflüssen, angewendet in der Flugplanung. In: Proceedings of GOR conference: Entscheidungsunterstützende Systeme in Supply Chain Managment und Logistik, pp. 335–356. Physika-Verlag (2005)Google Scholar
  10. 10.
    Engell, S., Märkert, A., Sand, G., Schultz, R.: Production planning in a multiproduct batch plant under uncertainty. Preprint 495-2001, FB Mathematik, Gerhard-Mercator-Universität Duisburg (2001)Google Scholar
  11. 11.
    Feldmann, R., Mysliwietz, M., Monien, B.: Studying overheads in massively parallel min/max-tree evaluation. In: 6th ACM Annual symposium on parallel algorithms and architectures (SPAA 1994), pp. 94–104. ACM, New York (1994)Google Scholar
  12. 12.
    Flemming, P.J., Wallace, J.J.: How not to lie with statistics: the correct way to summerize benchmark results. CACM 29(3), 218–221 (1986)CrossRefGoogle Scholar
  13. 13.
    Gertsbach, I., Gurevich, Y.: Constructing an optimal fleet for a transportation schedule. Transportation Science 11(1), 20–36 (1977)CrossRefGoogle Scholar
  14. 14.
    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
  15. 15.
    Gu, Z., Johnson, E.L., Nemhauser, G.L., Wang, Y.: Some properties of the fleet assignment problem. Operations Research Letters 15, 59–71 (1994)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    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
  17. 17.
    Kaindl, H., Scheucher, A.: The reason for the benefits of minmax search. In: Proc. of the 11th IJCAI, Detroit, MI, pp. 322–327 (1989)Google Scholar
  18. 18.
    Kniker, T.S., Barnhart, C.: Shortcomings of the conventional fleet assignment model. Technical report. MIT, Cambridge (1998)Google Scholar
  19. 19.
    Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artificial Intelligence 6(4), 293–326 (1975)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    Koenig, S., Furcy, D., Bauer, C.: Heuristic search-based replanning. In: Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling, pp. 294–301 (2002)Google Scholar
  21. 21.
    Kouvelis, P., Daniels, R.L., Vairaktarakis, G.: Robust scheduling of a two-machine flow shop with uncertain processing times. IIE Transactions 32(5), 421–432 (2000)Google Scholar
  22. 22.
    Leon, V.J., Wu, S.D., Storer, R.h.: A game-theoretic control approach for job shops in the presence of disruptions. International Journal of Production Research 32(6), 1451–1476 (1994)CrossRefMATHGoogle Scholar
  23. 23.
    Nau, D.S.: Pathology on game trees revisited, and an alternative to minimaxing. Artificial Intelligence 21(1-2), 221–244 (1983)MathSciNetCrossRefMATHGoogle Scholar
  24. 24.
    Osman, I.H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41, 421–451 (1993)CrossRefMATHGoogle Scholar
  25. 25.
    Papadimitriou, C.H.: Games against nature. Journal of Computer and System Science 31, 288–301 (1985)MathSciNetCrossRefMATHGoogle Scholar
  26. 26.
    Radicke, U.-D.: Algorithmen für das Fleet Assignment von Flugplänen. Verlag Shaker (1994)Google Scholar
  27. 27.
    Reinefeld, A.: An Improvement of the Scout Tree Search Algorithm. ICCA Journal 6(4), 4–14 (1983)Google Scholar
  28. 28.
    Römisch, W., Schultz, R.: Multistage stochastic integer programming: an introduction. In: Online Optimization of Large Scale Systems, pp. 581–600 (2001)Google Scholar
  29. 29.
    Rosenberger, J.M., Schaefer, A.J., Goldsman, D., Johnson, E.L., Kleywegt, A.J., Nemhauser, G.L.: Simair: A stochastic model of airline operations. In: Winter Simulation Conference Proceedings (2000)Google Scholar
  30. 30.
    Rushmeier, R.A., Kontogiorgis, S.A.: Advances in the optimization of airline fleet assignment. Transportation Science 31(2), 159–169 (1997)CrossRefMATHGoogle Scholar
  31. 31.
    Russel, S., Norvig, P.: Artificial Intelligence, A Modern Approach. Prentice Hall Series in Artificial Intelligence (2003)Google Scholar
  32. 32.
    Shannon, C.E.: Programming a computer for playing chess. Philosophical Magazine 41, 256–275 (1950)MathSciNetCrossRefMATHGoogle Scholar
  33. 33.
    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
  34. 34.
    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
  35. 35.
    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
  36. 36.
    Talluri, K.T.: Swapping applications in a daily airline fleet assignment. Transportation Science 30(3), 237–248 (1996)CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Sven Grothklags
    • 1
  • Ulf Lorenz
    • 2
  • Burkhard Monien
    • 3
  1. 1.Lufthansa Systems Berlin GmbH Airline Planning & ControlGermany
  2. 2.Institute of MathematicsDarmstadt University of TechnologyDarmstadtGermany
  3. 3.Faculty of Computer Science, Electrical Engineering and MathematicsUniversity of PaderbornPaderbornGermany

Personalised recommendations