Skip to main content
SpringerLink
Log in

Solving the Aircraft Assigning Problem by the Ant Colony Algorithm

  • Conference paper
Information and Management Engineering (ICCIC 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 236))

Included in the following conference series:

  • 1916 Accesses

Abstract

This paper sums the aircraft assigning problem up as vehicle routing problem, and constructs a mixed integer programming model. This model not only considers the link time and link airport between two consecutive flight strings, but also considers the available flying time for each aircraft. To solve this problem, an Ant Colony System (ACS) combining with the pheromone updating strategy of ASRank (Rank-based Version of Ant System) and MMAS (MAX-MIN Ant System) is proposed. Seven groups of initial flight string sets are used to test the method, and the important parameters of the algorithm are analyzed. The numerical results show that the method of this paper can effectively reduce the total link time between the continuous flight strings, and obtain the satisfactory solution with high convergence speed.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barnhart, C., Boland, N., Clarke, L., Johnson, E., Nemhauser, G., Shenoi, R.: Flight string models for aircraft fleeting and routing. Transportation Science 32, 208–220 (1998)

    Article  MATH  Google Scholar 

  2. Boland, N., Clarke, L., Nemhauser, G.: The asymmetric traveling salesman problem with replenishment arcs. European Journal of Operational Research 123, 408–427 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  3. Mak, V., Boland, N.: Heuristic approaches to the asymmetric travelling salesman problem with replenishment arcs. International Transactions in Operational Research 7, 431–447 (2000)

    Article  MathSciNet  Google Scholar 

  4. Clarke, L., Johnson, E., Nemhauser, G., Zhu, Z.: The aircraft rotation problem. Annals of Operations Research 69, 33–46 (1997)

    Article  MATH  Google Scholar 

  5. Sriram, C., Haghani, A.: An optimization model for aircraft maintenance scheduling and re-assignment. Transportation Research Part A 37, 29–48 (2003)

    Google Scholar 

  6. Rexing, B., Barnhart, C., Kniker, T., Jarrah, A., Krishnamurthy, N.: Airline fleet assignment with time windows. Transportation Science 34, 1–20 (2000)

    Article  MATH  Google Scholar 

  7. Bélanger, N., Desaulniers, G., Soumis, F., Desrosiers, J.: Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues. European Journal of Operational Research 175, 1754–1766 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  8. Sherali, H.D., Bish, E.K., Zhu, X.: Airline fleet assignment concepts, models, and algorithms. European Journal of Operational Research 172, 1–30 (2006)

    Article  MATH  Google Scholar 

  9. Haouari, M., Aissaoui, N., Mansour, F.Z.: Network flow based approaches for integrated aircraft fleeting and routing. European Journal of Operational Research 193, 591–599 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Du, Y.: A Optimal Method of Scheduled Flights for Civil Aircraft. Systems Engineering- Theory & Practice 8, 75–80 (1995)

    Google Scholar 

  11. Li, Y., Tan, N., Hao, G.: Study on flight string model and algorithm in flight scheduling. Journal of System Simulation 20, 612–615 (2008)

    Google Scholar 

  12. Dorigo, M., Gambardella, L.M.: Ant colonies for the travelling salesman problem. BioSystems 43, 73–81 (1997)

    Article  Google Scholar 

  13. Bullnheimer, B., Hartl, R.F., Strauss, C.: A new rank based version of the ant system: A computational study. Central European Journal for Operation Research and Economics 7, 25–28 (1999)

    MathSciNet  MATH  Google Scholar 

  14. Stutzle, T., Hoos, H.: Max-min ant system and local search for the traveling salesman problem. In: Proceedings of IEEE International Conference on Evolutionary Computation and Evolutionary Programming Conference. IEEE Press, New York (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Management and Engineering, Shanghai University of Finance and Economics, Shanghai, 200433, China

    Tao Zhang, Jing Lin, Biao Qiu & Yizhe Fu

Authors
  1. Tao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jing Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Biao Qiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yizhe Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Nanchang University, 235 Nanjing Donglu, 330047, Nanchang, China

    Min Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, T., Lin, J., Qiu, B., Fu, Y. (2011). Solving the Aircraft Assigning Problem by the Ant Colony Algorithm. In: Zhu, M. (eds) Information and Management Engineering. ICCIC 2011. Communications in Computer and Information Science, vol 236. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24097-3_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24097-3_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24096-6

  • Online ISBN: 978-3-642-24097-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation