2021
DOI: 10.1016/j.asoc.2021.107613
|View full text |Cite
|
Sign up to set email alerts
|

On the diversity and robustness of parameterised multi-objective test suites

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 36 publications
0
3
0
Order By: Relevance
“…To validate the developed APCE‐NSGA‐III algorithm, a classic multi‐objective optimization problem, ZDT1, is utilized in this section to illustrate the algorithm's accuracy. The ZDT1 problem and the corresponding theoretical Pareto frontier are expressed as follows (Yap et al., 2021): leftg1()X=x1leftg2()Xgoodbreak=h()X[]1x1/h()X,0.28emh()Xgoodbreak=1+9n1i=2nxileftxi[]0,0.28em1,0.28emigoodbreak=1,2,0.28em,nleftwith0.28emPareto0.28emsolutionsnormal:0.28emx1[]0,0.28em10.28emand0.28emxigoodbreak=0,0.28emigoodbreak=2,3,,n0.28em$$\begin{equation}\left\{ { \def\eqcellsep{&}\begin{array}{@{}*{1}{l}@{}} {{g}_1\left( \bf{X} \right) = {x}_1}\\ {{g}_2\left( \bf{X} \right) = h\left( \bf{X} \right)\left[ {1 - \sqrt {{x}_1/h\left( {\bm{X}} \right)} } \right],\;h\left( \bf{X} \right) = 1 + \frac{9}{{n - 1}}\mathop \sum \limits_{i = 2}^n {x}_i}\\ {{x}_i \in \left[ {0,\;1} \right],\;i = 1,2,\; \ldots ,n}\\ {{\mathrm{with}}\;{\mathrm{Pareto}}\;{\mathrm{solutions}}\text{:}\;{x}_1 \in \left[ {0,\;1} \right]\;and\;{x}_i = 0,\;i = 2,3, \ldots ,n\;} \end{array} } \right.\end{equation}$$…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…To validate the developed APCE‐NSGA‐III algorithm, a classic multi‐objective optimization problem, ZDT1, is utilized in this section to illustrate the algorithm's accuracy. The ZDT1 problem and the corresponding theoretical Pareto frontier are expressed as follows (Yap et al., 2021): leftg1()X=x1leftg2()Xgoodbreak=h()X[]1x1/h()X,0.28emh()Xgoodbreak=1+9n1i=2nxileftxi[]0,0.28em1,0.28emigoodbreak=1,2,0.28em,nleftwith0.28emPareto0.28emsolutionsnormal:0.28emx1[]0,0.28em10.28emand0.28emxigoodbreak=0,0.28emigoodbreak=2,3,,n0.28em$$\begin{equation}\left\{ { \def\eqcellsep{&}\begin{array}{@{}*{1}{l}@{}} {{g}_1\left( \bf{X} \right) = {x}_1}\\ {{g}_2\left( \bf{X} \right) = h\left( \bf{X} \right)\left[ {1 - \sqrt {{x}_1/h\left( {\bm{X}} \right)} } \right],\;h\left( \bf{X} \right) = 1 + \frac{9}{{n - 1}}\mathop \sum \limits_{i = 2}^n {x}_i}\\ {{x}_i \in \left[ {0,\;1} \right],\;i = 1,2,\; \ldots ,n}\\ {{\mathrm{with}}\;{\mathrm{Pareto}}\;{\mathrm{solutions}}\text{:}\;{x}_1 \in \left[ {0,\;1} \right]\;and\;{x}_i = 0,\;i = 2,3, \ldots ,n\;} \end{array} } \right.\end{equation}$$…”
Section: Discussionmentioning
confidence: 99%
“…To validate the developed APCE-NSGA-III algorithm, a classic multi-objective optimization problem, ZDT1, is utilized in this section to illustrate the algorithm's accuracy. The ZDT1 problem and the corresponding theoretical Pareto frontier are expressed as follows (Yap et al, 2021):…”
Section: Performance Of Apce-nsga-iii Algorithmmentioning
confidence: 99%
“…In this paper, the ZDT,UF and DTLZ series of test functions [28] are selected instead of the real functions for expensive multi-objective optimization problems. The number of objectives for the ZDT and UF series test function is 2, the number of decision variables is 10, and the population size is 100.…”
Section: ) Test Problem and Algorithm Parameter Settingmentioning
confidence: 99%