\setcounter{AlgoLine}{0}
\DontPrintSemicolon
	{
		\KwIn{GRASP procedure (with local search \texttt{LS} and parameter $0 \leqslant \alpha \leqslant 1$), parameters $I_{max}$ and $\mu$}
		\KwResult{Population $P$ of solutions}
		$P \leftarrow \varnothing$\\
		\While{$|P| < \mu$}
		{$s \leftarrow  GRASP(\alpha, \texttt{LS})$\\
			\If{$s \notin P$}
			{$P \leftarrow P \cup s$}
		}
		\For{$I_{max}$ iterations}
		{  $s \leftarrow  GRASP(\alpha, \texttt{LS})$\\
			Randomly draw $s' \in P$\;
			Apply a path relinking method between $s$ and $s'$; identifying the best solution $s''$ of the path\\ 
			\If{$s'' \notin P$ and $s''$ is strictly better than a solution of $P$}
			{$s''$ replaces the most different solution of $P$ which is worse than $s''$}
		}
	}


