1:	$x\leftarrow$ InitialSolution (); $P\leftarrow \{x\}\text{;}\bar{Z}\leftarrow 1$
2:	$\mathcal{N}(\kappa )\leftarrow$ SelectFirstNeighborhood ()
3:	while StoppingCriterionNotMet () do
4:	$\overline{x}\leftarrow$ RescheduleWithTrueTravelSpeeds ($\overline{x}\text{,}Z$) $\forall \overline{x}\in P$
5:	for$\overline{x}\in P$do
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:	$Z\leftarrow$ SelectSampledAccidents ($\bar{Z}$)
14:	$x\leftarrow$ SelectCurrentIncumbent ($P\text{,}Z$)
15:	$\bar{Z}\leftarrow$ AdaptSampleSize ($\bar{Z}$)
16:	end if
17:	$x^{\prime }\leftarrow$ ShakeSolution ($x\text{,}\mathcal{N}(\kappa )$)
18:	if$x^{\prime }\notin P$then
19:	$P\leftarrow P\cup \{x^{\prime }\}$
20:	end if
21:	$\mathcal{N}(\kappa )\leftarrow$ SelectNextNeighborhood ($\kappa$)
22:	end while