Then, the solutions are evaluated by means of the objective function value (OFV). The algorithm contains two main loops. The first loop generates a solution randomly. Successively, using a neighborhood structure, new solutions are obtained and the best one is chosen. However, similar to the SA...
Evaluate P using the function F; while No convergence do P′ := Selection of parents in P; P′ := Apply the crossing operator on P′; P′ := Apply the mutation operator on P′; P := Replace old parents of P by their descendants in P′; Evaluate P using the function F; EndFig...
4.6.1. Damage Case 1 In the optimization process, the initial value of the damage factor (usually µ0 = [1, 1, ··· , 1], i.e., the undamaged state) is first selected. After calculating the value range of the objective function of mode shape and frequency respectively, the ...