Table - PMC

Skip to main content

View full-text article in PMC

. 2022 Mar 9;22(6):2100. doi: 10.3390/s22062100

Algorithm 1 Algorithm of NSGA-2

1:
while termination criteria do
2:
$R_{t} \leftarrow P_{t} \cup Q_{t}$
3:
$F \leftarrow$ non_dominated_sorting( $R_{t}$ )
4:
$P_{t + 1} \leftarrow ϕ; i \leftarrow 1$
5:
while $| P_{t + 1} | + | F_{i} | \leq N$ do
6:
$C_{i} \leftarrow$ crowd_sourcing_assignment( $F_{i}$ )
7:
$P_{t + 1} \leftarrow P_{t} \cup F_{i}$
8:
$i = i + 1$
9:
end while
10:
$F_{i} \leftarrow s o r t (F_{i}, C_{i}, d e s c)$
11:
$P_{t + 1} \leftarrow P_{t + 1} \cup F_{i} [1 : (N - | P_{t + 1} |)]$
12:
$Q_{t + 1} \leftarrow s e l e c t i o n (P_{t + 1}, N)$
13:
$Q_{t + 1} \leftarrow m u t a t i o n (Q_{t + 1})$
14:
$Q_{t + 1} \leftarrow c r o s s o v e r (Q_{t + 1})$
15:
$t \leftarrow t + 1$
16:
end while