\setcounter{AlgoLine}{0}
\DontPrintSemicolon
{\KwIn{Solution $s$, neighbourhood $N(\cdot)$, objective functions $\overrightarrow{f}(\cdot)$ to minimize; parameter $I_{max}$}
	\KwResult{Approximation $P$ of the Pareto set}
	$P = {s}$\\
	\For{$I_{max}$ iterations}
	{Randomly draw a weight vector $\overrightarrow{w}$\\
		\Repeat{$end$}
		{$end \leftarrow$ true \\
			$best\_neighbour\_value \leftarrow \infty$ \\
			\ForAll{$s' \in N(s)$}
			{
				\If{$s'$ is not dominated by solutions of $P$}
				{Insert $s'$ in $P$ and remove the solutions of $P$ dominated by $s'$}
				\If{$\overrightarrow{w} \cdot \overrightarrow{f}(s') < best\_neighbour\_value$}
				{$best\_neighbour\_value \leftarrow \overrightarrow{w} \cdot \overrightarrow{f}(s')$\\
					$best\_neighbour \leftarrow s'$} 
			}
			\If{$best\_neighbour\_value < \overrightarrow{w} \cdot \overrightarrow{f}(s)$}
			{$s \leftarrow best\_neighbour$\\
				$end \leftarrow$ false}
			
		}
	}
}
