Normal view MARC view ISBD view

PMT : opposition based learning technique for enhancing metaheuristic algorithms performance / Hammoudeh S. Alamri

By:

Hammoudeh S. Alamri [author.]

Material type: Text

text

Media type:

unmediated

Carrier type:

volume

ISBN:

THE0008591(Local)

Subject(s):

Dissertation note: Thesis (Doctor of Philosophy) -- Universiti Malaysia Pahang – 2021 Abstract: 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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 2 )
Title notes ( 4 )

Holdings
Item type	Current library	Collection	Call number	Copy number	Status	Date due	Barcode
Thesis	UMPLIB PEKAN	Reference	CD 12881 (Browse shelf(Opens below))	1	Not for loan		T000001430
Thesis	UMPLIB PEKAN Reference	Reference	FKOM .H36 2020 r Thesis (Browse shelf(Opens below))	1	Not for loan		T000001429

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.