All bi-objective mechanical design optimization problems studied.

All bi-objective mechanical design optimization problems studied.

<p>All bi-objective mechanical design optimization problems studied.</p>

محفوظ في:

التفاصيل البيبلوغرافية
المؤلف الرئيسي:	Vahid Goodarzimehr (21343124) (author)
مؤلفون آخرون:	João Luiz Junho Pereira (9650599) (author), Nima Khodadadi (14581091) (author)
منشور في:	2025
الموضوعات:	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
الوسوم:	إضافة وسم لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!

مواد مشابهة

Hardest general multi-objective problems.
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

Real design multi-objective problems (Adapted from [33]).
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

Friedman test for the Engineering problems.
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

Friedman tests for the CEC 2009 problems.
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

Schematic of some engineering problems [34].
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

Mean HV.
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

MS results of algorithms in the CEC 2009 test functions.
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

SP results of algorithms in the CEC 2009 test functions.
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

IGD results.
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

Commonly used metaheuristics Hyperparameters.
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

MOSRS’s pseudocode.
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

Graphical assessment of competitive algorithms by MS metric (UF7:UF10).
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

Graphical assessment of competitive algorithms by MS metric (UF1:UF6).
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

Graphical assessment of competitive algorithms by SP metric (UF7:UF10).
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

Graphical assessment of competitive algorithms by SP metric (UF1:UF6).
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

Graphical assessment of competitive algorithms by IGD metric (UF7:UF10).
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

Graphical assessment of competitive algorithms by IGD metric (UF1:UF6).
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

Summarizing the IGD, SP, and MS results with a radar plot.
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

CEC 2009 rounds for some algorithms, highlighting MOSRS (UF9-UF10).
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

CEC 2009 rounds for some algorithms, highlighting MOSRS (UF5:UF8).
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

CEC 2009 rounds for some algorithms, highlighting MOSRS (UF1:UF4).
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

Flowchart of MOSRS algorithm.
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

The radius of this circular motion.
حسب: Vahid Goodarzimehr (21343124)
منشور في: (2025)

The direction of the magnetic force [1].
حسب: Vahid Goodarzimehr (21343124)
منشور في: (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.
حسب: Ihab Hashem (21156806)
منشور في: (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.
حسب: Ihab Hashem (21156806)
منشور في: (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.
حسب: Ihab Hashem (21156806)
منشور في: (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.
حسب: Ihab Hashem (21156806)
منشور في: (2025)

Illustration of the recursive objective space exploration process implemented by the ROSE algorithm.
حسب: Ihab Hashem (21156806)
منشور في: (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 .
حسب: Ihab Hashem (21156806)
منشور في: (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.
حسب: Ihab Hashem (21156806)
منشور في: (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.
حسب: Ihab Hashem (21156806)
منشور في: (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.
حسب: Ihab Hashem (21156806)
منشور في: (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.
حسب: Ihab Hashem (21156806)
منشور في: (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.
حسب: Ihab Hashem (21156806)
منشور في: (2025)

Figures
حسب: Thang Xuan Le (20972549)
منشور في: (2025)

Bi-objective GRLP datasets
حسب: Lazar Mrkela (10524500)
منشور في: (2025)

Bi-objective GRLP datasets
حسب: Lazar Mrkela (10524500)
منشور في: (2025)

Scheduling Optimization for Autoclave Molding: Single Batch Processing Machine Scheduling with Release Dates and Time Windows
حسب: Anonymous authors (for blind review purpose) (11882042)
منشور في: (2024)

Results of the algorithms in solving engineering design optimization problems.
حسب: Yanzhao Gu (21192659)
منشور في: (2025)

Cannot write session to /tmp/vufind_sessions/sess_6bjt1cq2bse3ohv7kqt0mq2r03