Graphical assessment of competitive algorithms by SP metric (UF1:UF6).

Graphical assessment of competitive algorithms by SP metric (UF1:UF6).

<p>Graphical assessment of competitive algorithms by SP metric (UF1:UF6).</p>

Saved in:

Bibliographic Details
Main Author:	Vahid Goodarzimehr (21343124) (author)
Other Authors:	João Luiz Junho Pereira (9650599) (author), Nima Khodadadi (14581091) (author)
Published:	2025
Subjects:	Biological Sciences not elsewhere classified Mathematical Sciences not elsewhere classified Information Systems not elsewhere classified special relativity physics lower computational costs inverted generational distance deliver pareto fronts constrained world problems objective optimization stands div >< p algorithms -% 2b objective optimization studied problems user sets publicly available promising avenue principles inspired population ). parameters using paper presents new algorithms metaheuristics offer maximum spread literature today literature shows first time eleven metaheuristics cec 2009 21 real
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Graphical assessment of competitive algorithms by SP metric (UF7:UF10).
by: Vahid Goodarzimehr (21343124)
Published: (2025)

Graphical assessment of competitive algorithms by MS metric (UF7:UF10).
by: Vahid Goodarzimehr (21343124)
Published: (2025)

Graphical assessment of competitive algorithms by MS metric (UF1:UF6).
by: Vahid Goodarzimehr (21343124)
Published: (2025)

Graphical assessment of competitive algorithms by IGD metric (UF7:UF10).
by: Vahid Goodarzimehr (21343124)
Published: (2025)

Graphical assessment of competitive algorithms by IGD metric (UF1:UF6).
by: Vahid Goodarzimehr (21343124)
Published: (2025)

CEC 2009 rounds for some algorithms, highlighting MOSRS (UF9-UF10).
by: Vahid Goodarzimehr (21343124)
Published: (2025)

CEC 2009 rounds for some algorithms, highlighting MOSRS (UF5:UF8).
by: Vahid Goodarzimehr (21343124)
Published: (2025)

CEC 2009 rounds for some algorithms, highlighting MOSRS (UF1:UF4).
by: Vahid Goodarzimehr (21343124)
Published: (2025)

SP results of algorithms in the CEC 2009 test functions.
by: Vahid Goodarzimehr (21343124)
Published: (2025)

Summarizing the IGD, SP, and MS results with a radar plot.
by: Vahid Goodarzimehr (21343124)
Published: (2025)

Mean HV.
by: Vahid Goodarzimehr (21343124)
Published: (2025)

MS results of algorithms in the CEC 2009 test functions.
by: Vahid Goodarzimehr (21343124)
Published: (2025)

IGD results.
by: Vahid Goodarzimehr (21343124)
Published: (2025)

Real design multi-objective problems (Adapted from [33]).
by: Vahid Goodarzimehr (21343124)
Published: (2025)

Commonly used metaheuristics Hyperparameters.
by: Vahid Goodarzimehr (21343124)
Published: (2025)

Hardest general multi-objective problems.
by: Vahid Goodarzimehr (21343124)
Published: (2025)

MOSRS’s pseudocode.
by: Vahid Goodarzimehr (21343124)
Published: (2025)

Friedman test for the Engineering problems.
by: Vahid Goodarzimehr (21343124)
Published: (2025)

All bi-objective mechanical design optimization problems studied.
by: Vahid Goodarzimehr (21343124)
Published: (2025)

Friedman tests for the CEC 2009 problems.
by: Vahid Goodarzimehr (21343124)
Published: (2025)

Schematic of some engineering problems [34].
by: Vahid Goodarzimehr (21343124)
Published: (2025)

Flowchart of MOSRS algorithm.
by: Vahid Goodarzimehr (21343124)
Published: (2025)

The radius of this circular motion.
by: Vahid Goodarzimehr (21343124)
Published: (2025)

The direction of the magnetic force [1].
by: Vahid Goodarzimehr (21343124)
Published: (2025)

Performance comparison of six algorithms—MOPSO, rNSGA-II, IM-MOEA/D, MOEA/D-FRR-MAB, dMOPSO, and QLNSGA-II—on selected UF test functions: UF1, UF4, UF7, UF8, and UF9.
by: Zhongfeng Li (3965060)
Published: (2025)

Comparing ROSE and the NBI algorithm combined with a SF with varying resolutions of the ROSE stopping criterion and the SF specification when applied to the DOD2K problem: (a) (b) (c) (d) Comparing the mean number of iterations per Pareto point for both algorithms across different ROSE stopping criterion/SF specifications.
by: Ihab Hashem (21156806)
Published: (2025)

Pareto front representations with adaptive density obtained by solving the DO2DK problem using the ROSE algorithm and the NBI algorithm coupled with posteriori filtering via a SF are depicted, along with a visualization of the solution process of the ROSE algorithm in the objective space. The stopping criterion of the ROSE algorithm, which aligns with the SF specification, was set to .
by: Ihab Hashem (21156806)
Published: (2025)

Comparing ROSE and the NBI algorithm combined with a SF with varying resolutions of the ROSE stopping criterion and the SF specification when applied to the CONSTR- problem: (a) (b) (c) (d) Comparing the mean number of iterations per Pareto point for both algorithms across different ROSE stopping criterion/SF specifications.
by: Ihab Hashem (21156806)
Published: (2025)

Pareto front representations for with adaptive density obtained by solving the CONSTR- problem using the ROSE algorithm and the NBI algorithm coupled with posteriori filtering via a SF are depicted, along with a visualization of the solution process of the ROSE algorithm in the objective space.
by: Ihab Hashem (21156806)
Published: (2025)

Comparing ROSE and the NBI algorithm combined with a SF with varying resolutions of the ROSE stopping criterion and the SF specification when applied to the BIOBJ problem: (a) (b) (c) (d) Comparing the mean number of iterations per Pareto point for both algorithms across different ROSE stopping criterion/SF specifications.
by: Ihab Hashem (21156806)
Published: (2025)

Pareto front representations with adaptive density obtained by solving the BIOBJ problem using the ROSE algorithm and the NBI algorithm coupled with posteriori filtering via a SF are depicted, along with a visualization of the solution process of the ROSE algorithm in the objective space.
by: Ihab Hashem (21156806)
Published: (2025)

Comparing ROSE and the NBI algorithms with varying sizes of the Pareto set/levels of recursion of the ROSE algorithm when applied to the BIOBJ problem: (a) 5 points/two recursion levels (b) 17 points/4 recursion levels (c) 65 points/6 recursion levels (d) Comparing mean number of iterations per Pareto point for both algorithms across different sizes of the Pareto set/recursion levels.
by: Ihab Hashem (21156806)
Published: (2025)

Pareto front representations obtained by solving the BIOBJ problem using the ROSE algorithm and the NBI algorithm, as well as a visualization of the solution process of the ROSE algorithm in the objective space.
by: Ihab Hashem (21156806)
Published: (2025)

Illustration of the recursive objective space exploration process implemented by the ROSE algorithm.
by: Ihab Hashem (21156806)
Published: (2025)

Solving the three-objectives numerical problem from [36] using a generalized version of the ROSE algorithm for three-objective problems: (a) The Pareto front representation corresponding to three recursive levels of the algorithm. (b) Visualization of the solution process in the three-dimensional objective space.
by: Ihab Hashem (21156806)
Published: (2025)

Comparing ROSE and the NBI algorithm combined with a SF with same , applied to the problem of the bi-objective optimization of an I-Beam using different initial values of <i>x</i><sub><i>o</i></sub> that correspond to starting at different points in the objective space: (a) Run 1, <i>x</i><sub><i>o</i></sub> = <i>[</i>45,35,3.8,1.2<i>]</i> (b) <i>x</i><sub><i>o</i></sub> = <i>[</i>30,20,1.5,4<i>]</i> (c)<i>x</i><sub><i>o</i></sub> = <i>[</i>45,35,2,4<i>]</i> (d) Comparing the mean number of iterations per significant Pareto point for both algorithms across runs from different initial guesses.
by: Ihab Hashem (21156806)
Published: (2025)

Figures
by: Thang Xuan Le (20972549)
Published: (2025)

Statistical test results of HV and p-values for WFG and UF problems.
by: Zhongfeng Li (3965060)
Published: (2025)

Statistical test results of IGD and p-values for WFG and UF problems.
by: Zhongfeng Li (3965060)
Published: (2025)

Parameter settings and performance evaluation criteria for WFG and UF test functions.
by: Zhongfeng Li (3965060)
Published: (2025)

Cannot write session to /tmp/vufind_sessions/sess_vr5bv26er7kuaqlqlh9h4j6ar2