Review on computational techniques in solving aircraft landing problem

Citation

Zulkifli, Aminurafiuddin and Ab Aziz, Nor Azlina and Ibrahim, Zuwairie and Mokhtar, Norrima (2018) Review on computational techniques in solving aircraft landing problem. In: 2018 International Conference on Artificial Life and Robotics (ICAROB2018), 2018, Oita, Japan.

Full text not available from this repository.

Abstract

The problem of sequencing and scheduling arriving aircraft landing is commonly known as aircraft landing problem (ALP). This problem, due to various constraints such as the number of arriving aircrafts, the number of runways, the mode of runway operation, the type of arriving aircrafts, the minimum separation between each arriving aircraft, and the weather condition, is considered to be a NP-hard problem. Therefore, it is almost impossible to compute every possible solution and computational intelligence methods had been adopted to solve ALP. In this paper, we review the computational intelligence techniques used in ALP. The main techniques include the evolutionary algorithms namely; genetic algorithm, genetic programming, scatter search and bionomic algorithm, the swarm intelligence algorithms like particle swarm optimization and ant colony optimization and also other methods such as the constrained position shifting and dynamic programming.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Computational intelligence
Subjects: Q Science > Q Science (General) > Q300-390 Cybernetics
Divisions: Faculty of Engineering and Technology (FET)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 07 Mar 2021 02:06
Last Modified: 21 Dec 2022 06:26
URII: http://shdl.mmu.edu.my/id/eprint/7366

Downloads

Downloads per month over past year

View ItemEdit (login required)