A Systematic Review of Optimization Algorithms for Structural Health Monitoring and Optimal Sensor Placement

. 2023 Mar 20;23(6):3293. doi: 10.3390/s23063293

Algorithm 2 Pseudo-code for DE Algorithm.

1:
Initialize the population x with randomly generated solutions
2:
Set the weight $F \in [0, 2]$ and crossover probability $C_{r} \in [0, 1]$
3:
while stopping criterion do
4:
for $i = 1 : n$ do
5:
For each $x_{i}$ , randomly choose 3 distinct vectors $x_{p}$ , $x_{r}$ and $x_{t}$
6:
Generate a new vector $ν$ by DE scheme
7:
Generate a random index $J_{r} \in \{1, 2, . . ., d\}$ by permutation
8:
Generate a randomly distributed number $r_{i} \in [0, 1]$
9:
end for
10:
for $j = 1 t o d$ do
11:
For each parameter $ν_{i, j}$ (jth component of $ν_{i}$ ), update
12:
$u_{i, j}^{t + 1} = \{\begin{matrix} ν_{i, j}^{t + 1} if r_{i} ⩽ C_{r} or j = J_{r} \\ x_{i, j}^{t^{'}} if r_{i} > C_{r} and j \neq J_{r}, \end{matrix}$
13:
end for
14:
select and update the solution
15:
end while