Algorithm 11 HS

Input: the parameters M (or HMS), N,$\delta$, HMCR, PAR and BW Begin S1: initialize the harmony memory filled with M solutions that are randomly generated, 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: generate new harmony according to Equations (43) and (44); if it is better than one harmony in HM, replace it, iterative times t = t + 1; go to step S2; S4: output the optimized results. End