03015nam a2200349 i 4500 0 0 lcc 0 0 REF 20000 20000 REF 2022-01-05 0 FKOM .H36 2020 r Thesis T000001429 2022-03-31 00:00:00 1 2022-01-05 THESIS 0 0 lcc 0 0 REF 20000 20000 2022-02-17 0 CD 12881 T000001430 2022-02-17 00:00:00 1 2022-02-17 THESIS 96194 96200 MY-KuUP 20251125105938.0 a||||fr|||| 001 0 ta 220217t20202020my a|||frma|| 001 0 eng d THE0008591(Local) UMP eng UMP rda FKOM .H36 2020 r Thesis Hammoudeh S. Alamri, author. PMT : opposition based learning technique for enhancing metaheuristic algorithms performance / Hammoudeh S. Alamri Kuantan, Pahang : UMP ; 2020 © 2020 xii, 139 pages : illustrations (some color) ; 30 cm. + 1 CD-ROM text rdacontent unmediated rdamedia volume rdacarrier text file xPDF rda Faculty of Computing Thesis (Doctor of Philosophy) -- Universiti Malaysia Pahang – 2021 Includes bibliographical references Metaheuristic algorithms have shown promising performance in solving sophisticated real-world optimization problems. Nevertheless, many metaheuristic algorithms are still suffering from a low convergence rate because of the poor balance between exploration (i.e. roaming new potential search areas) and exploitation (i.e., exploiting the existing neighbors). In some complex problems, the convergence rate can still be poor owing to becoming trapped in local optima. Opposition-based learning (OBL) has shown promising results to address the aforementioned issue. Nonetheless, OBL-based solutions often consider one particular direction of the opposition. Considering only one direction can be problematic as the best solution may come in any of a multitude of directions. Addressing these OBL limitations, this research proposes a new general OBL technique inspired by a natural phenomenon of parallel mirrors systems called the Parallel Mirrors Technique (PMT). Like existing OBL-based approaches, the PMT generates new potential solutions based on the currently selected candidate. Unlike existing OBL-based techniques, the PMT generates more than one candidate in multiple solution-space directions. To evaluate the PMT’s performance and adaptability, the PMT was applied to four contemporary metaheuristic algorithms, Differential Evolution, Particle Swarm Optimization, Simulated Annealing, and Whale Optimization Algorithm, to solve 15 well-known benchmark functions as well as 2 real world problems based on the welded beam design and pressure vessel design. Experimentally, the PMT shows promising results by accelerating the convergence rate against the original algorithms with the same number of fitness evaluations comparing to the original metaheuristic algorithms in benchmark functions and real-world optimization problems. Faculty of Computing Dissertations Universities and colleges Dissertations Theses lcc THESIS