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.

Downloads

Download data is not yet available.

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

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)