Harmony Search Algorithm for the Multiple Runways Aircraft Landing Scheduling Problem

Authors

  • Omar Salim Abdullah Centre for Artificial Intelligence Technology, Faculty of Information Science and Technology, Universiti Kebangsaan Malaysia. University of Diyala, College of Pure Science. Iraq.
  • Salwani Abdullah Centre for Artificial Intelligence Technology, Faculty of Information Science and Technology, Universiti Kebangsaan Malaysia.
  • Hafiz Mohd Sarim Centre for Artificial Intelligence Technology, Faculty of Information Science and Technology, Universiti Kebangsaan Malaysia.

Keywords:

Aircraft Landing Scheduling Problem, Combinatorial Optimization Problem, Harmony Search Algorithm,

Abstract

This paper proposes a Harmony Search (HS) algorithm to solve the multiple runways aircraft landing scheduling (ALS) problem. ALS is a combinatorial optimization problem that has been recognized as an NP-hard problem. It deals with assigning landing times and runways for a set of arrival aircrafts. Each aircraft has its predefined target landing time within a time window, and a separation time between each successive pairs of aircrafts. The objective of ALS problem is to minimize the deviation from the target landing time of each aircraft subject to a set of constraints. The performance of the proposed algorithm is evaluated on thirteen benchmark instances ranging from 10 to 500 aircrafts, and 1 to 5 runways. The results show that the proposed algorithm works considerably well on small-sized instances.

References

Ernst, A.T., Krishnamoorthy, M. and Storer, R.H., 1999. Heuristic and exact algorithms for scheduling aircraft landings. Networks, 34(3), pp.229-241.

Pinol, H. and Beasley, J.E., 2006. Scatter search and bionomic algorithms for the aircraft landing problem. European Journal of Operational Research, 171(2), pp.439-462.

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

Girish, B.S., 2016. An efficient hybrid particle swarm optimization algorithm in a rolling horizon framework for the aircraft landing problem. Applied Soft Computing, 44, pp.200-221.

Salehipour, A., Modarres, M. and Naeni, L.M., 2013. An efficient hybrid meta-heuristic for aircraft landing problem. Computers & Operations Research, 40(1), pp.207-213.

Jaddi, N.S. and Abdullah, S., 2017. A cooperative-competitive masterslave global-best harmony search for ANN optimization and waterquality prediction. Applied Soft Computing, 51, pp.209-224.Moh, O. et al., 2011.

Zeng, B. and Dong, Y., 2016. An improved harmony search based energy-efficient routing algorithm for wireless sensor networks. Applied Soft Computing, 41, pp.135-147.

Zheng, Y.J., Zhang, M.X. and Zhang, B., 2016. Biogeographic harmony search for emergency air transportation. Soft Computing, 20(3), pp.967-977.

Wang, G.G., Gandomi, A.H., Zhao, X. and Chu, H.C.E., 2016. Hybridizing harmony search algorithm with cuckoo search for global numerical optimization. Soft Computing, 20(1), pp.273-285.

Sun, W. and Chang, X., 2015. An improved harmony search algorithm for power distribution network planning. Journal of Electrical and Computer Engineering, 2015, p.5.

Gao, K.Z., Suganthan, P.N., Pan, Q.K., Chua, T.J., Cai, T.X. and Chong, C.S., 2016. Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives. Journal of Intelligent Manufacturing, 27(2), pp.363-374.

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

Fesanghary, M., Mahdavi, M., Minary-Jolandan, M. and Alizadeh, Y., 2008. Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems. Computer methods in applied mechanics and engineering, 197(33), pp.3080- 3091.

Yuan, Y., Xu, H. and Yang, J., 2013. A hybrid harmony search algorithm for the flexible job shop scheduling problem. Applied Soft Computing, 13(7), pp.3259-3272.

Moh’d Alia, O., Al-Betar, M.A., Mandava, R. and Khader, A.T., 2011, December. Data clustering using harmony search algorithm. In International Conference on Swarm, Evolutionary, and Memetic Computing (pp. 79-88). Springer Berlin Heidelberg.

Geem, Z.W., 2010. State-of-the-art in the structure of harmony search algorithm. In Recent Advances In Harmony Search Algorithm (pp. 1- 10). Springer Berlin Heidelberg.

Beasley, J.E., Krishnamoorthy, M., Sharaiha, Y.M. and Abramson, D., 2000. Scheduling aircraft landings—the static case. Transportation science, 34(2), pp.180-197.

Al-Betar, M.A. and Khader, A.T., 2009, August. A hybrid harmony search for university course timetabling. In Proceedings of the 4nd multidisciplinary conference on scheduling: theory and applications (MISTA 2009), Dublin, Ireland (pp. 157-179).

Turky, A.M. and Abdullah, S., 2014. A multi-population harmony search algorithm with external archive for dynamic optimization problems. Information Sciences, 272, pp.84-95.

Downloads

Published

2017-11-30

How to Cite

Abdullah, O. S., Abdullah, S., & Mohd Sarim, H. (2017). Harmony Search Algorithm for the Multiple Runways Aircraft Landing Scheduling Problem. Journal of Telecommunication, Electronic and Computer Engineering (JTEC), 9(3-7), 59–65. Retrieved from https://jtec.utem.edu.my/jtec/article/view/3076

Issue

Vol. 9 No. 3-7: Intelligent System Modeling and Control

Section

Articles

License

TRANSFER OF COPYRIGHT AGREEMENT

The manuscript is herewith submitted for publication in the Journal of Telecommunication, Electronic and Computer Engineering (JTEC). It has not been published before, and it is not under consideration for publication in any other journals. It contains no material that is scandalous, obscene, libelous or otherwise contrary to law. When the manuscript is accepted for publication, I, as the author, hereby agree to transfer to JTEC, all rights including those pertaining to electronic forms and transmissions, under existing copyright laws, except for the following, which the author(s) specifically retain(s):

  1. All proprietary right other than copyright, such as patent rights
  2. The right to make further copies of all or part of the published article for my use in classroom teaching
  3. The right to reuse all or part of this manuscript in a compilation of my own works or in a textbook of which I am the author; and
  4. The right to make copies of the published work for internal distribution within the institution that employs me

I agree that copies made under these circumstances will continue to carry the copyright notice that appears in the original published work. I agree to inform my co-authors, if any, of the above terms. I certify that I have obtained written permission for the use of text, tables, and/or illustrations from any copyrighted source(s), and I agree to supply such written permission(s) to JTEC upon request.