| Algorithm 2: Adaptive Reconstruction and Elimination Mechanism |
Input:
2: Perform the search process (as described in Section 2.2.2); 3: Utilize the K-means clustering method to reorganize all subpopulations; 4: Select pbest1, pbest2, …, pbestK as the cluster centers from each subPop1, subPop2, …, subPopK; 5: in Pop: 6: and each pbest1, pbest2, …, pbestK; 7: to the subpopulation with the closest distance to its corresponding cluster center; 8: end for 9: for each subPopK: 10: if the number of individuals in a subpopulation is less than the Threshold: 11: Eliminate the subpopulation subPopK; 12: end if 13: end for 14: Continue the search process; 15: end while 16: Return the global optimal solution gbest. |