Algorithm 1 GA

Input: the parameters M, N,$\delta$, ${\vartheta }_1$,${\vartheta }_2$ and ${\vartheta }_3$ Begin S1: encode and initialize M individuals $x_i\left(t\right)$randomly,$0<i\le M,$ iterative times t = 1; S2: compute$f\left(i\right), 0<i\le M$, update$p_g\left(t\right)$, if it satisfies (t > N or precision$\le \delta$), then go to step S4; otherwise, go to step S3; S3: execute$s_o$,$c_o$ and $m_o$operations to generate new solutions according to ${\vartheta }_1$,${\vartheta }_2$ and ${\vartheta }_3$, iterative times t = t + 1; go to step S2; S4: output the optimized results. End