Skip to main content

Fleet Scheduling Optimization: A Simulated Annealing Approach

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2079))

Abstract

The fleet assignment problem belongs to large-scale combinatorial optimization problems. It consists in assigning aircraft types to a fixed schedule in order to obtain the best possible financial gain with the best fit of aircrafts capacities to estimated demand. The next step after the assignment of aircraft types is the aircraft routing, i.e. the assignment of flight sequences to particular aircrafts with respect to scheduled maintenances. In this paper we present an optimization method for the whole fleet scheduling, i.e. the fleet assignment together with the aircraft routing. Our method is based on the simulated annealing heuristic. We have successfully optimized the fleet scheduling for the period of one month and obtained results some 10-12% better than that of the airline company. All tests were performed on a real set of data.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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.

References

  1. Abara, J.: Applying Integer Linear Programming to the Fleet Assignment Problem. Interfaces 19 (1989) 20–28

    Google Scholar 

  2. Hane, C.A., Barnhardt, C., Johnson, E.L., Marsten, R.E., Nemhauser, G.L., Sigismondi, G.: The Fleet Assignment Problem: Solving a Large-Scale Integer Problem. Math. Program. 70 (1995) 211–232

    Google Scholar 

  3. Dillon, J., Gopalan, R., Petrofsky, R., Ramachandran, S., Rushmeier, R., Talluri, K.: Fleet Assignment. Presentation inside USAir, March 1993

    Google Scholar 

  4. R. Subramanian et al.: Coldstart: Fleet Assignment at Delta Airlines. Interfaces 24 (1994) 104–120

    Google Scholar 

  5. Berge, M.E., Hopperstad, C.A.: Demand Driven Dispatch: A Method for Dynamic Aircraft Capacity Assignment, Models and Algorithms. Oper. Res. 41 (1993) 153–168

    Article  MATH  Google Scholar 

  6. Barnhart, C., Boland, N.L., Clarke, L.W., Johnson, E.L., Nemhauser, G.L., Shenoi, R.G.: Flight String Models for Aircraft Fleeting and Routing. In: Proc. AGIFORS Symp. (1997)

    Google Scholar 

  7. Talluri, K.T.: Swapping Applications in a Daily Airline Fleet Assignment. Transport. Sci. 30 (1996) 237–248

    MATH  Google Scholar 

  8. Gopalan, R., Talluri, K.T.: The Aircraft Maintenance Routing Problem. Oper. Res. 46 (1998) 260–271

    MATH  Google Scholar 

  9. Talluri, K.T.: The Four-Day Aircraft Maintenance Routing Problem. Transport. Sci. 32 (1998) 43–53

    MATH  Google Scholar 

  10. Clarke, L.W., Hane, C.A., Johnson, E.L., Nemhauser, G.L.: Maintenance and Crew Considerations in Fleet Assignment. Transport. Sci. 30 (1995) 921–934

    Google Scholar 

  11. Al-Haimy, A.A.: Development of a Mathematical Model for Airline Fleet Planning. In: Proc. 24th AGIFORS Symp. (1984)

    Google Scholar 

  12. Hajek, B.: Cooling Schedules for Optimal Annealing. Math. Oper. Res. 13 (1998) 311–329

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Sringer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sosnowska, D., Rolim, J. (2001). Fleet Scheduling Optimization: A Simulated Annealing Approach. In: Burke, E., Erben, W. (eds) Practice and Theory of Automated Timetabling III. PATAT 2000. Lecture Notes in Computer Science, vol 2079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44629-X_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-44629-X_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42421-5

  • Online ISBN: 978-3-540-44629-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics