Skip to main content

Single Runway Aircraft Landing Scheduling Using Simulated Annealing and Exact Timing Method

  • Conference paper
  • First Online:
  • 753 Accesses

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

Abstract

One of the most challenging optimization problems in air traffic control is minimizing the deviation of aircraft arrival times from its target landing time. This can be achieved by efficiently allocating landing times and runways to the arriving aircraft. This problem is called the Aircraft Landing Problem (ALP). To address the ALP, this paper proposes a new approach which combines the Simulated Annealing (SA) algorithm with an exact timing method. The problem is solved in two stages: first, the optimal sequence is generated using the SA; in the second stage, the optimal landing time is determined using the exact timing method. The proposed approach is tested with \( 500 \) aircraft and a single runway using a well-known benchmark dataset from the scientific literature. The obtained results demonstrated the ability of the proposed approach to generate promising and competitive results.

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 EPUB and 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

References

  1. Al-Betar, M.A., Khader, A.T.: A hybrid harmony search for university course timetabling. In: Proceedings of the 4th Multidisciplinary Conference on Scheduling: Theory and Applications (MISTA 2009), Dublin, Ireland, pp. 157–179 (2009)

    Google Scholar 

  2. Girish, B.S.: An efficient hybrid particle swarm optimization algorithm in a rolling horizon framework for the aircraft landing problem. Appl. Soft Comput. 44, 200–221 (2016)

    Article  Google Scholar 

  3. Beasley, J.E., Krishnamoorthy, M., Sharaiha, Y.M., Abramson, D.: Scheduling aircraft landings—the static case. Transp. Sci. 34(2), 180–197 (2000)

    Article  Google Scholar 

  4. Fesanghary, M., Mahdavi, M., Minary-Jolandan, M., Alizadeh, Y.: Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems. Comput. Methods Appl. Mech. Eng. 197(33), 3080–3091 (2008)

    Article  Google Scholar 

  5. Gao, K.Z., Suganthan, P.N., Pan, Q.K., Chua, T.J., Cai, T.X., Chong, C.S.: Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives. J. Intell. Manuf. 27(2), 363–374 (2016)

    Article  Google Scholar 

  6. Geem, Z.W.: State-of-the-art in the structure of harmony search algorithm. In: Geem, Z.W. (ed.) Recent Advances in Harmony Search Algorithm. SCI, vol. 270, pp. 1–10. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-04317-8_1

    Chapter  MATH  Google Scholar 

  7. Jaddi, N.S., Abdullah, S.: A cooperative-competitive master-slave global-best harmony search for ANN optimization and water-quality prediction. Appl. Soft Comput. 51, 209–224 (2017)

    Article  Google Scholar 

  8. Alia, O.M., Al-Betar, M.A., Mandava, R., Khader, A.T.: Data clustering using harmony search algorithm. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Satapathy, S.C. (eds.) SEMCCO 2011. LNCS, vol. 7077, pp. 79–88. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-27242-4_10

    Chapter  Google Scholar 

  9. Pinol, H., Beasley, J.E.: Scatter search and bionomic algorithms for the aircraft landing problem. Eur. J. Oper. Res. 171(2), 439–462 (2006)

    Article  Google Scholar 

  10. Sabar, N.R., Kendall, G.: An iterated local search with multiple perturbation operators and time varying perturbation strength for the aircraft landing problem. Omega 56, 88–98 (2015)

    Article  Google Scholar 

  11. Salehipour, A., Modarres, M., Naeni, L.M.: An efficient hybrid meta-heuristic for aircraft landing problem. Comput. Oper. Res. 40(1), 207–213 (2013)

    Article  MathSciNet  Google Scholar 

  12. Sun, W., Chang, X.: An improved harmony search algorithm for power distribution network planning. J. Electr. Comput. Eng. 2015, 5 (2015)

    Google Scholar 

  13. Turky, A.M., Abdullah, S.: A multi-population harmony search algorithm with external archive for dynamic optimization problems. Inf. Sci. 272, 84–95 (2014)

    Article  Google Scholar 

  14. Wang, G.G., Gandomi, A.H., Zhao, X., Chu, H.C.E.: Hybridizing harmony search algorithm with cuckoo search for global numerical optimization. Soft. Comput. 20(1), 273–285 (2016)

    Article  Google Scholar 

  15. Yuan, Y., Xu, H., Yang, J.: A hybrid harmony search algorithm for the flexible job shop scheduling problem. Appl. Soft Comput. 13(7), 3259–3272 (2013)

    Article  Google Scholar 

  16. Zeng, B., Dong, Y.: An improved harmony search based energy-efficient routing algorithm for wireless sensor networks. Appl. Soft Comput. 41, 135–147 (2016)

    Article  Google Scholar 

  17. Zheng, Y.J., Zhang, M.X., Zhang, B.: Biogeographic harmony search for emergency air transportation. Soft. Comput. 20(3), 967–977 (2016)

    Article  MathSciNet  Google Scholar 

  18. Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60–68 (2001)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Omar Salim Abdullah .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jassam, A., Abdullah, O.S., Abdullah, S., Bassel, A. (2020). Single Runway Aircraft Landing Scheduling Using Simulated Annealing and Exact Timing Method. In: Khalaf, M., Al-Jumeily, D., Lisitsa, A. (eds) Applied Computing to Support Industry: Innovation and Technology. ACRIT 2019. Communications in Computer and Information Science, vol 1174. Springer, Cham. https://doi.org/10.1007/978-3-030-38752-5_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-38752-5_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-38751-8

  • Online ISBN: 978-3-030-38752-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics