MbrlCatalogueTitleDetail

Do you wish to reserve the book?
Multi-Objective Stochastic Fractal Search: a powerful algorithm for solving complex multi-objective optimization problems
Multi-Objective Stochastic Fractal Search: a powerful algorithm for solving complex multi-objective optimization problems
Hey, we have placed the reservation for you!
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Multi-Objective Stochastic Fractal Search: a powerful algorithm for solving complex multi-objective optimization problems
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Title added to your shelf!
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Multi-Objective Stochastic Fractal Search: a powerful algorithm for solving complex multi-objective optimization problems
Multi-Objective Stochastic Fractal Search: a powerful algorithm for solving complex multi-objective optimization problems

Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
How would you like to get it?
We have requested the book for you! Sorry the robot delivery is not available at the moment
We have requested the book for you!
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Multi-Objective Stochastic Fractal Search: a powerful algorithm for solving complex multi-objective optimization problems
Multi-Objective Stochastic Fractal Search: a powerful algorithm for solving complex multi-objective optimization problems
Journal Article

Multi-Objective Stochastic Fractal Search: a powerful algorithm for solving complex multi-objective optimization problems

2020
Request Book From Autostore and Choose the Collection Method
Overview
Stochastic Fractal Search (SFS) is a novel and powerful metaheuristic algorithm. This paper presents a Multi-Objective Stochastic Fractal Search (MOSFS) for the first time, to solve complex multi-objective optimization problems. The presented algorithm uses an external archive to collect efficient Pareto optimal solutions during the optimization process. Using dominance rules, leader selection and grid mechanisms, MOSFS precisely approximates the true Pareto optimal front. The MOSFS is implemented on nine multi-objective benchmark functions (CEC 2009 ) with multimodal, convex, discrete and non-convex optimal Pareto fronts. Performance of the proposed algorithm is compared to well-known algorithms. In addition, different performance measures are considered to evaluate the convergence and coverage abilities of the algorithms including Inverted Generational Distance, Maximum Spread and Spacing. Furthermore, statistical analyses are utilized to determine the superior algorithm. The results revealed that the MOSFS performs significantly better than other algorithms in both convergence and coverage and it is able to approximate true Pareto front precisely. In the end, MOSFS is implemented to solve a real-world engineering design problem called welded beam design problem and efficiency of the algorithm is compared to recently developed algorithms. The results of simulations and the Wilcoxon rank-sum test showed that the MOSFS is able to provide the most promising Pareto front for the problem considering various performance metrics at a 95% confidence level.