Designing and Developing a Novel Metaheuristic Algorithm: Root Search Algorithm, M.Sc. Thesis Sharif University of Technology ; Modarres Yazdi, Mohammad (Supervisor)
Abstract
This thesis develops a novel metaheuristic algorithm –Root Search algorithm- which is inspired by behavior of tree roots. The Root Search (RS) algorithm is capable of approximating an upperbound for the gap between obtained solution by itself and the optimal solution. In order to evaluating proposed algorithm’s performance, firstly a continuous genetic algorithm is defined, secondly both algorithms are implemented on several unconstrained continuous optimization problems, and finally the results are compared. Additionally this thesis reviews natural-insured metaheuristic algorithms so that the unique aspects of the RS algorithm can be distinguished
Cataloging briefDesigning and Developing a Novel Metaheuristic Algorithm: Root Search Algorithm, M.Sc. Thesis Sharif University of Technology ; Modarres Yazdi, Mohammad (Supervisor)
Abstract
This thesis develops a novel metaheuristic algorithm –Root Search algorithm- which is inspired by behavior of tree roots. The Root Search (RS) algorithm is capable of approximating an upperbound for the gap between obtained solution by itself and the optimal solution. In order to evaluating proposed algorithm’s performance, firstly a continuous genetic algorithm is defined, secondly both algorithms are implemented on several unconstrained continuous optimization problems, and finally the results are compared. Additionally this thesis reviews natural-insured metaheuristic algorithms so that the unique aspects of the RS algorithm can be distinguished
Find in contentBookmark |
|