2022
DOI: 10.1016/j.eswa.2021.116126
|View full text |Cite
|
Sign up to set email alerts
|

Guided Manta Ray foraging optimization using epsilon dominance for multi-objective optimization in engineering design

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
13
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 22 publications
(13 citation statements)
references
References 37 publications
0
13
0
Order By: Relevance
“…Meanwhile, a crowding distance and ε-dominance are utilized to provide a good compromise between diversity and convergence of the obtained potential Pareto set. The experimental results demonstrate that the MOMRFO algorithm outperforms and can provide better convergence and diversity of solutions [10].…”
Section: Introductionmentioning
confidence: 92%
See 2 more Smart Citations
“…Meanwhile, a crowding distance and ε-dominance are utilized to provide a good compromise between diversity and convergence of the obtained potential Pareto set. The experimental results demonstrate that the MOMRFO algorithm outperforms and can provide better convergence and diversity of solutions [10].…”
Section: Introductionmentioning
confidence: 92%
“…Allocate the crowding distance for each individual using normalization due to the projection of adjacent individuals at the same level. The crowding distance could be calculated using Equation (10).…”
Section: Imocs Implementation Stepsmentioning
confidence: 99%
See 1 more Smart Citation
“…The proposed algorithm uses an external archive population to store non-dominant solutions based on the Epsilon dominance found during the search best solutions [31] . Initially, this external archive initially contains all non-dominated solutions from the initial parent population .…”
Section: Proposed Algorithm: G-moea/d-samentioning
confidence: 99%
“…We aimed to gauge their capabilities in swiftly converging to the true Pareto optimal front and the distribution of the obtained non-dominated solutions. Upon assessing their convergence and coverage using MO metrics and the produced Pareto optimal fronts on benchmark suites (ZDT [ 54 ], DTLZ [ 54 ], Constraint [ 68 , 69 ] and engineering design problems [ 55 , 56 ]), we discerned that these algorithms still exhibited shortcomings in convergence and coverage using metrics like generational distance (GD) [ 70 ], inverse generational distance (IGD) [ 71 ], hypervolume [ 72 ], Spacing [ 73 ], Spread [ 72 ] and run time (RT). The approximations of the Pareto-front produced by our method are evaluated using these metrics.…”
Section: Introductionmentioning
confidence: 99%