STEP 1: Initial parameters of ECMPDE including ng, NP, ${\lambda }_i$ , MaxG and MaxFes; Initialize pop;

$X_{i,d}=L_d+rand\left(0,1\right)\ast \left(U_d-L_d\right)$ (25);

STPE 2: Evaluate the objective function value and overall constraint violation value of each individual;

STPE 3: Initial the parameters for JADE, jDE and EPSDE; Set $\Delta f_i=0$ and $\Delta fe{s}_i=0\left(i=1,2,3\right)$ ;

STPE 4: Set $N{P}_i={\lambda }_i\cdot NP$ , Randomly assigned based on population size $po{p}_1$ , $po{p}_2$ , $po{p}_3$ and $po{p}_4$ ;

STPE 5: A combination $P_i$ is randomly selected from the combination pool;

STPE 6: Execute JADE on $po{p}_1$ , $po{p}_1$ is selected and updated by $po{p}_1\left(S\right),S\in \left\{A,B\right\}$ and calculated in (23) $\Delta f_1$ ;

STPE 7: Execute jDE on $po{p}_2$ , $po{p}_2$ is selected and updated by $po{p}_2\left(S\right),S\in \left\{A,B\right\}$ and calculated in (23) $\Delta f_2$ ;

STPE 8: Execute EPSDE on $po{p}_3$ , $po{p}_3$ is selected and updated by $po{p}_3\left(S\right),S\in \left\{A,B\right\}$ and calculated in (23) $\Delta f_3$ ;

STPE 9: The best combination of the three populations is selected by (24), it will run to the reward population $po{p}_4$ , and calculated (23) and saved $\Delta f_4$ ;

STPE 10: By comparing the optimal solution of the optimal combination of the previous generation with that of the current generation, the successful combination will be preserved;

STPE 11: Combine updated $po{p}_1$ , $po{p}_2$ , $po{p}_3$ and $po{p}_4$ , i.e., $pop=\underset{i=1,2,3,4}{\cup }po{p}_i$ ;

STPE 12: Randomly assigned based on population size $po{p}_1$ , $po{p}_2$ , $po{p}_3$ and $po{p}_4$ ;

STPE 13: Stop if the termination condition is met. If not, k = k + 1, proceed to step 5.