Algorithm 1. The Procedure of the Conventional VNS
1:	Let $s$$\mathrm{be} \mathrm{the} \mathrm{initial} \mathrm{solution}, N_k$ be the shaking neighborhood structures, $k=1,\dots ,k_{max}$ and $N_l$ be the local search $\mathrm{neighborhood} \mathrm{structures}, l=1,\dots ,l_{max}$. Set $k=1$.
2:	Repeat
3:	$\hspace{1em}${Shaking procedure}
4:	$\hspace{1em}{s}^{\prime }=Shaking\left(s,N_k\right)$ //Shaking procedure
5:	$\hspace{1em}${Local Search}
6:	$\hspace{1em}$for$l=1$to$l_{max}$do //Local search
7:	$\hspace{1em} s^{″}=LocalSearch\left(s^{\prime },N_l\right)$//perform local search on$s^{\prime }$with neighborhood structure $N_l$
8:	$\hspace{1em}$if $f\left(s^{″}\right)>f\left(s^{\prime }\right)$//checking if$s^{\prime }$is improved
9:	$\hspace{1em}\hspace{1em}{s}^{\prime }=s^{″}$
10:	$\hspace{1em}\hspace{1em}l=1$//turn to the first neighborhood structure for local search
11:	$\hspace{1em}$else
12:	$\hspace{1em}\hspace{1em}l=l+1$//turn to the next neighborhood structure for local search
13:	$\hspace{1em}$end for
14:	$\hspace{1em}${Accept decision}
15:	$\hspace{1em}$if $f\left(s^{\prime }\right)>f\left(s\right)$//checking if$s$ is improved
16:	$\hspace{1em} s=s^{\prime }$
17:	$\hspace{1em} k=1$//turn to the first neighborhood structure for shaking
18:	$\hspace{1em}$else
19:	$\hspace{1em} k=k+1$//turn to the next neighborhood structure for shaking
20:	$\hspace{1em}$end if
21:	Until the upper limit $T$ of time or the maximum number of iterations $Z_{max}$ is reached