Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/513388Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Salwani Abdullah, Prof. Dr. | - |
| dc.contributor.author | Omar Salim Abdullah (P74197) | - |
| dc.date.accessioned | 2023-10-16T04:36:08Z | - |
| dc.date.available | 2023-10-16T04:36:08Z | - |
| dc.date.issued | 2019-09 | - |
| dc.identifier.other | ukmvital:122134 | - |
| dc.identifier.uri | https://ptsldigital.ukm.my/jspui/handle/123456789/513388 | - |
| dc.description | The Aircraft Landing Problem (ALP) is a challenging task for air traffic controllers in an airport. ALP is a non-deterministic polynomial-time hard (NP-hard) problem that deals with assigning an available runway and a landing time to an arriving aircraft. The landing time of each aircraft must be within a stipulated target landing time. If the actual landing time deviates from the target landing time, an additional cost will be imposed. This cost is determined by the amount of earliness or lateness with respect to the actual landing time. ALP can be divided into static and dynamic problems. The static ALP (s-ALP) occurs when all the information on aircraft are fixed and there is no change in the information when the scheduling process commences. On the other hand, the dynamic ALP (d-ALP) considers changes in the information that occur during the scheduling process as new aircraft may appear in the radar range. Solving both static and dynamic ALPs aim to minimize the overall cost i.e., the deviation from a preferred target time of each aircraft. The complexity of the ALP draws the attention of researchers from various research domains to generate a robust system that supports air traffic controllers in making the landing decision. Many heuristic and metaheuristic approaches have been developed to derive a highly effective solution for this complicated problem. The research work presented in this thesis aims to build upon the state-of-the-art search methodologies for aircraft scheduling problems by investigating the use of the Harmony Search Algorithm (HSA) as a population-based algorithm for s-ALP and d-ALP. The research first investigates HSA and incorporates a number of rules to control the neighborhood structures employed during the optimization process. This contribution systematically avoids the slow convergence problem in the traditional HSA algorithm as a result of the random strategy deployed therein. Afterward, a hybridization between HSA and Variable Neighborhood Search (VNS) is proposed to improve the ability of the HSA in exploring an unvisited region in the search space. Moreover, Simulated Annealing (SA) is used to avoid the local optimum. The newly proposed algorithm is coded as VNHSA. The VNS replaces the pitch consideration rate condition in the improvisation step in the original HSA which ensures the algorithm is not stuck in the local optimum. Due to the fact that unpredictable changes might occur during the course of an ongoing scheduling process, the applicability of the VNHSA is tested on d-ALP. The proposed approaches are tested using well-known datasets from OR-library with a range of 10 to 500 aircraft and 1 to 5 runways. Computational results based on standard benchmark datasets demonstrate the effectiveness of the proposed algorithm. Further evaluations are made through comparisons with the best results from other approaches in the scientific literature and statistical tests. The results show that the proposed approaches are able to obtain competitive results and can be deployed in practice.,Ph.D. | - |
| dc.language.iso | eng | - |
| dc.publisher | UKM, Bangi | - |
| dc.relation | Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat | - |
| dc.rights | UKM | - |
| dc.subject | Universiti Kebangsaan Malaysia -- Dissertations | - |
| dc.subject | Dissertations, Academic -- Malaysia | - |
| dc.subject | Algorithms | - |
| dc.subject | Landing craft | - |
| dc.subject | Air traffic controllers | - |
| dc.title | Modified harmony search algorithms for the aircraft landing problem | - |
| dc.type | Theses | - |
| dc.format.pages | 197 | - |
| dc.identifier.callno | QA76.9.A43A233 2019 3 tesis | - |
| dc.identifier.barcode | 005543(2021)(PL2) | - |
| Appears in Collections: | Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ukmvital_122134+SOURCE1+SOURCE1.0.PDF Restricted Access | 2.59 MB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.