Harmony search algorithm for the multiple runways aircraft landing scheduling problem

Omar Salim Abdullah, Salwani Abdullah, Hafiz Mohd Sarim

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)59-65
Number of pages7
JournalJournal of Telecommunication, Electronic and Computer Engineering
Volume9
Issue number3-7
Publication statusPublished - 1 Jan 2017

Fingerprint

Aircraft landing
Scheduling
Aircraft
Landing
Airport runways
Combinatorial optimization
Computational complexity

Keywords

  • Aircraft landing scheduling problem
  • Combinatorial optimization problem
  • Harmony search algorithm

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{69122d615a4e42a887c937406f84bebe,
title = "Harmony search algorithm for the multiple runways aircraft landing scheduling problem",
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.",
keywords = "Aircraft landing scheduling problem, Combinatorial optimization problem, Harmony search algorithm",
author = "Abdullah, {Omar Salim} and Salwani Abdullah and {Mohd Sarim}, Hafiz",
year = "2017",
month = "1",
day = "1",
language = "English",
volume = "9",
pages = "59--65",
journal = "Journal of Telecommunication, Electronic and Computer Engineering",
issn = "2180-1843",
publisher = "Universiti Teknikal Malaysia Melaka",
number = "3-7",

}

TY - JOUR

T1 - Harmony search algorithm for the multiple runways aircraft landing scheduling problem

AU - Abdullah, Omar Salim

AU - Abdullah, Salwani

AU - Mohd Sarim, Hafiz

PY - 2017/1/1

Y1 - 2017/1/1

N2 - 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.

AB - 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.

KW - Aircraft landing scheduling problem

KW - Combinatorial optimization problem

KW - Harmony search algorithm

UR - http://www.scopus.com/inward/record.url?scp=85041715365&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85041715365&partnerID=8YFLogxK

M3 - Article

VL - 9

SP - 59

EP - 65

JO - Journal of Telecommunication, Electronic and Computer Engineering

JF - Journal of Telecommunication, Electronic and Computer Engineering

SN - 2180-1843

IS - 3-7

ER -