Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/513296Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Masri Ayob, Prof. Dr. | |
| dc.contributor.author | Anas W.A. Arram (P73048) | |
| dc.date.accessioned | 2023-10-16T04:35:19Z | - |
| dc.date.available | 2023-10-16T04:35:19Z | - |
| dc.date.issued | 2017-07-10 | |
| dc.identifier.other | ukmvital:98987 | |
| dc.identifier.uri | https://ptsldigital.ukm.my/jspui/handle/123456789/513296 | - |
| dc.description | Berth Allocation Problem (BAP) and Travelling Salesman problems (TSP) are classified as non-deterministic polynomial-time hard (NP-hard) problems, which are difficult to solve for optimality in reasonable amount of time. Many metaheuristic methods have been developed to solve NP-hard problems, however, most of these algorithms have some drawbacks such as, weak ability to explore the search space and facing difficulties to operate on different datasets. The need to either enhance the existing algorithms or utilize a new algorithm is still necessary. Recently, Bird Mating Optimizer algorithm (BMO) have been proposed to solve several optimization problems with strong exploration ability. The BMO algorithm was successfully applied to many continuous optimization problems. However, as far as we are concerned, its application on combinatorial optimization problems are very limited and never been applied to solve the BAP or TSP. BMO is an intelligent technique that can explore the search space in order to find a good quality solution by employing three types of operators: two parents mating, multi parents mating and mutation. However, despite the good performance of BMO, there are still a lot of rooms for improvements. The most important challenges include: (i) finding an appropriate application of BMO to solve combinatorial problems as it was originally proposed to solve continuous problems, (ii) using an effective multi-parent crossover as a multi-parent mating operator that can produce solutions with reasonable computational time, (iii) improve the exploitation ability of the algorithm to improve the solution quality by hybridizing it with single-based methods, (iv) automatically adjust the parameters and components of the hybrid BMO. Therefore, this research aims to investigate the effectiveness of BMO in solving two combinatorial optimization problems: BAP and TSP by introducing the following objectives: firstly, we investigate the suitable representation for applying the BMO for solving BAP and TSP. Secondly, a new multi-parent crossover is proposed in order to reduce the computational time of the BMO and produce better quality solutions over both tested domains. In order to improve the exploitation mechanism of BMO, we then hybridize BMO (that responsible for exploration) with five single-based meta-heuristics (SBHs) (i.e Hill-Climbing, Late Acceptance Hill Climbing, Simulated Annealing, Iterated Greedy Algorithm and Variable Iterated Greedy Algorithm). Finally, a meta-BMO is proposed to automatically select SBHs and BMO parameters for each problem domain/instance during the search process without external interference. Results tested on BAP and TSP demonstrated that the proposed BMOs had obtained competitive results in most instances for both problems domains when compared to the best known method in the literature. This demonstrates that combining BMO with SBHs along with the use of meta optimization technique to automatically tune the BMO components during the search process, produces an effective BMO technique that can improve the basic BMO and work well across both BAP and TSP problems.,Certification of Master's/Doctoral Thesis" is not available | |
| 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 | Algorithms | |
| dc.subject | Combinatorial optimization | |
| dc.title | Bird mating optimizer for combinatorial optimization problems | |
| dc.type | Theses | |
| dc.format.pages | 215 | |
| dc.identifier.callno | QA402.5.A737 2017 3 tesis | |
| dc.identifier.barcode | 003227(2018) | |
| Appears in Collections: | Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ukmvital_98987+SOURCE1+SOURCE1.0.PDF Restricted Access | 430.92 kB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.