Skip to main content
SpringerLink
Log in
Book cover

Mathematik in der Praxis pp 509–532Cite as

Bestimmung optimaler Einsatzpläne für Flugpersonal

  • Chapter

  • 243 Accesses

Zusammenfassung

Unter dem Airline-Crew-Scheduling-Problem versteht man das Problem, einen optimalen Einsatzplan für das fliegende Personal einer Fluggesellschaft zu finden. Das Airline-Crew-Scheduling-Problem wurde während der vergangenen 40 Jahre kontinuierlich untersucht, wobei stets nach approximativen Lösungen gesucht wurde, selbst bei sehr kleinen Flottengrößen. Da die Ko¬sten für das fliegende Personal der größten US-Fluggesellschaften heutzutage nicht selten 1,3 Milliarden US-Dollar überschreiten (sie bilden nach den Treibstoffkosten den zweitgrößten Posten der gesamten Betriebskosten), ist das Airline-Crew-Scheduling-Problem von zentraler Bedeutung. Einsparungen von wenigen Prozent bei den Kosten für das fliegende Personal schlagen sich in erheblichen absoluten Beträgen nieder.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   59.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. Anbil, R., E. Gelman, B. Patty and R. Tanga: Recent Advances in Crew Pairing Optimization at American Airlines. Interfaces 21 (1991) 62–74

    Article  Google Scholar 

  2. E. Balas and M. Padberg: Set Partitioning: A survey. SIAM Review 18 (1976) 710–760

    Article  MathSciNet  MATH  Google Scholar 

  3. Barahona, M., M. Grötschel, M. Jünger and G. Reinelt: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design. Operations Research 36 (1988) 493–513

    Article  MATH  Google Scholar 

  4. Barnhart, C., E. L. Johnson, R. Anbil and L. Hatay: A Column Gene-ration Technique for the Long-haul Crew Assignment Problem. Report #COC-91-Ol, School of Industrial and System Engineering, Georgia Institute of Technology 1991

    Google Scholar 

  5. Barutt, J. and T. Hull: Airline Crew Scheduling: Supercomputers and Algorithms, SIAM News 23 (1990) November

    Google Scholar 

  6. Bixby, R. E.: Implementing the Simplex Methods. Part I, Introduction. Part II, The Initial Basis. TR 90-32 Mathematical Sciences, Rice University, Houston, TX 1990

    Google Scholar 

  7. Bixby, R. E. and E. Boyd: Using the CPLEX Callable Library. Manuals distributed by Cplex Optimization INC., 7710-T Cherry Park, Houston, TX 1990

    Google Scholar 

  8. Borneman, D. R.: The Evolution of Airline Crew Pairing Optimization. AGIFORS Crew Management Study Group Proceedings, Paris, May 1982

    Google Scholar 

  9. Cannon, T. L. and K. L.Hoffman: Large-Scale 0–1 Linear Programming on Distributed Workstations. Annals of Operations Research 22 (1990) 181–217

    Article  MathSciNet  MATH  Google Scholar 

  10. Crowder, H., E. L. Johnson and M. Padberg: Solving Large Scale Zero- one Linear Programming Problems. Operations Research 31 (1983) 803–834

    Article  MATH  Google Scholar 

  11. Cornuejols, G. and A. Sassano: On the 0, 1 Facets of the Set Covering Polytope. Mathematical Programming 43 (1989) 45–56

    Article  MathSciNet  MATH  Google Scholar 

  12. Desrochers, M. and F. Soumis: A Column Generation Approach to the Urban Transit Crew Scheduling Problem. Transportation Sci. 23 (1989) 1–13

    Article  MATH  Google Scholar 

  13. Ger bracht, R.: A New Algorithmn for Very Large Crew Pairing Problems. 18th AGIFORS Symposium, Vancouver, British Columbia, Canada 1978

    Google Scholar 

  14. Gershkoff, I.: Optimizing Flight Crew Schedules. Interfaces 19 (1989) 29–43

    Article  Google Scholar 

  15. Grötschel, M. and C. L. Monma: Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints. SIAM J. Discrete Mathematics 3 (1990) 502–523

    Article  MATH  Google Scholar 

  16. Grötschel, M., M. Jünger and G. Reinelt: Optimal Control of Plotting and Drilling Machines: A Case Study. Report No. 184, Universität Augsburg 1989

    Google Scholar 

  17. Hoffman, K. L. and M. Padberg: LP-based Combinatorial Problem Solving. Annals of Operations Research 4 (1985) 145–194

    Article  MathSciNet  Google Scholar 

  18. Hoffman, K. L. and M. Padberg: Techniques for Improving the LP- representation of Zero-one Linear Programming Problems. ORSA Journal on Computing 3 (1991) 121–134

    MATH  Google Scholar 

  19. Hoffman, K. L. and M. Padberg: Solving Airline Crew Scheduling Problems by Branch-and-Cut. Management Science 39 (1993) 657–682

    Article  MATH  Google Scholar 

  20. Lavoie, S., M. Minoux and E. Odier: A New Approach for Crew Pairing Problems by Column Generation with Application to Air Transportation. EJOR 35 (1988) 45–58

    Article  MATH  Google Scholar 

  21. Marsten, R. E. and F. Shepardson: Exact Solution of Crew Problems using the Set Partitioning Mode: Recent Successful Applications. Networks 11 (1981) 165–177

    Article  Google Scholar 

  22. Padberg, M.: Essays in Integer Programming. Ph. D. thesis, GSIA, Carnegie-Mellon University, Pittsburgh, PA 1971

    Google Scholar 

  23. Padberg, M.: On the Facial Structure of Set Packing Polyhedra. Mathematical Programming 5 (1973) 199–215

    Article  MathSciNet  MATH  Google Scholar 

  24. Padberg, M.: A Note on Zero-one Programming. Operations Research 23 (1975) 833–837

    Article  MathSciNet  MATH  Google Scholar 

  25. Padberg, M.: Covering, Packing and Knapsack Problems. Annals of Discrete Mathematics 4 (1979) 265–287

    Article  MathSciNet  MATH  Google Scholar 

  26. Padberg, M. and G. Rinaldi: An efficient Algorithm for the Minimum Capacity Cut Problem. Mathematical Programming 47 (1990) 19–36

    Article  MathSciNet  MATH  Google Scholar 

  27. Padberg, M. and G. Rinaldi: A Branch-and-Cut Algorithm for the Solution of Large-scale Traveling Salesman Problems. SIAM Review 33 (1991) 60–100

    Article  MathSciNet  MATH  Google Scholar 

  28. Rubin, J.: A Technique for the Solution of Massive Set Covering Problems, with Applications to Airline Crew Scheduling. Transportation Sci. 7 (1973) 34–48

    Article  Google Scholar 

  29. Sassano, A.: On the Facial Structure of the Set Covering Polytope. Mathematical Programming 44 (1989) 181–202

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Operations Research Department, George Mason University, Fairfax, USA

    Karla Hoffman

  2. New York University, New York, USA

    Manfred Padberg

Authors
  1. Karla Hoffman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manfred Padberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematisches Institut, Universität zu Köln, Weyertal 86-90, D-50931, Köln, Germany

    Achim Bachem

  2. Institut für Informatik, Universität zu Köln, Pohligstraße 1, D-50969, Köln, Germany

    Michael Jünger  & Rainer Schrader  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hoffman, K., Padberg, M. (1995). Bestimmung optimaler Einsatzpläne für Flugpersonal. In: Bachem, A., Jünger, M., Schrader, R. (eds) Mathematik in der Praxis. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79763-7_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-79763-7_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-79764-4

  • Online ISBN: 978-3-642-79763-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation