arrow
返回

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

delete2019-05-21
delete78
PRE
AI
S
Soheyl Khalilpourazari *
B
Bahman Naderi
S
Saman Khalilpourazary
DOI:10.1007/s00500-019-04080-6delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
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.
Keyword:
Multi-Objective Stochastic Fractal Search
Multi-objective optimization
Metaheuristic algorithm
Multi-criteria optimization
Engineering optimization
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Soft Computing 封面图
Soft Computing
IF:
2.5
论文数:
1.0W
被引数:
2.1W

机构

U
Urmia University of Technology
学者数:
627
论文数: 737
被引数: 1
U
university of windsor
学者数:
4.4K
论文数: 4.5K
被引数: 3
K
Kharazmi University
学者数:
2.3K
论文数: 2.1K
被引数: 2.1K
学者 查看更多机构
引用论文

引用论文

Mechanisms of renal injury and progression of renal disease in congenital obstructive nephropathy
err2009-10-21
err0
PREAI
errRobert L. Chevalier; Barbara A. Thornhill; Michael S. Forbes; Susan C. Kiley
err分享
err收藏
err分享
err收藏
A multi-objective artificial bee colony algorithm一种多目标人工蜂群算法
err2012-02-01
err282
PREAI
errAkbari, Reza; Hedayatzadeh, Ramin; Ziarati, Koorush; Hassanizadeh, Bahareh
err分享
err收藏
Grey Wolf Optimizer灰狼优化器
err2014-03-01
err1.3W
PREAI
errMirjalili, Seyedali; Mirjalili, Seyed Mohammad; Lewis, Andrew
err分享
err收藏
The pilot Stroke Data Bank: definition, design, and data.
err1984-07-01
err0
errOAAI
errS C Kunitz; C R Gross; A Heyman; C S Kase; J P Mohr; T R Price; P A Wolf
err分享
err收藏
Social problem-solving among disadvantaged and non-disadvantaged adolescents
err2017-03-13
err0
PREAI
errLászló Kasik; Fejes József Balázs; Kornél Guti; Csaba Gáspár; Anikó Zsolnai
err分享
err收藏
学者 查看更多内容