1:	$x\leftarrow$ InitialSolution (); $P\leftarrow \{x\}$
2:	$\mathcal{N}(\kappa )\leftarrow$ SelectFirstNeighborhood ()
3:	while StoppingCriterionNotMet () do
4:	$\overline{x}\leftarrow$ RescheduleWithTrueTravelSpeeds ($\overline{x}$) $\forall \overline{x}\in P$
5:	for$\overline{x}\in P$
6:	if$(\overline{x}\ne x)\wedge (\text{Timeout}(\overline{x}\text{,}x)\vee \text{Departure}(\overline{x}\text{,}x))$then
7:	$P\leftarrow P⧹\{\overline{x}\}$
8:	else if NewRequestsPresent () then
9:	InsertNewRequests ($\overline{x}$)
10:	end if
11:	end for
12:	if HasChanged (P) then
13:	$x\leftarrow$ SelectCurrentIncumbent (P)
14:	end if
15:	$x^{\prime }\leftarrow$ ShakeSolution ($x\text{,}\mathcal{N}(\kappa )$)
16:	if$x^{\prime }\notin P$then
17:	$P\leftarrow P\cup \{x^{\prime }\}$
18:	end if
19:	$\mathcal{N}(\kappa )\leftarrow$ SelectNextNeighborhood ($\kappa$)
20:	end while