Benchmarking Meta-Heuristic Optimization
Journal: International Journal of Advanced Networking and Applications (Vol.11, No. 06)Publication Date: 2020-06-08
Authors : Mona Nasr; Omar Farouk; Ahmed Mohamedeen; Ali Elrafie; Marwan Bedeir; Ali Khaled;
Page : 4451-4457
Keywords : Optimization; Algorithms; Benchmark;
Abstract
Solving an optimization task in any domain is a very challenging problem, especially when dealing with nonlinear problems and non-convex functions. Many meta-heuristic algorithms are very efficient when solving nonlinear functions. A meta-heuristic algorithm is a problem-independent technique that can be applied to a broad range of problems. In this experiment, some of the evolutionary algorithms will be tested, evaluated, and compared with each other. We will go through the Genetic Algorithm, Differential Evolution, Particle Swarm Optimization Algorithm, Grey Wolf Optimizer, and Simulated Annealing. They will be evaluated against the performance from many points of view like how the algorithm performs throughout generations and how the algorithm’s result is close to the optimal result. Other points of evaluation are discussed in depth in later sections.
Other Latest Articles
- Asymptotical Synchronization Of Coupled Time-Delay Partial Differential Systems Via Pinning Control And Boundary Control
- Secure Handover Protocol For High Speed 5G Networks
- ASSESSING JAPANESE FEMALE COLLEGE STUDENT FEELINGS ABOUT MATHEMATICS LEARNING AREA CONTENTS
- A DESIGNED SCIENCE INQUIRY TRAINING PROGRAMME FOR PRE-PRIMARY TEACHERS IN NIGERIA
- ENGLISH PROFICIENCY LEVEL OF GRADE THREE TEACHERS AND NATIONAL ACHIEVEMENT TEST (NAT) PERFORMANCE OF PUPILS IN PUBLIC ELEMENTARY SCHOOLS
Last modified: 2020-08-06 19:22:48