A Disruption Recovery Problem with Time Windows Change in the Last Mile Delivery of Online Shopping

Algorithm 1

VVND.

1k=1;iter=0;

2S=InitalSolution();

3Repeat

4rd = rand();

5if rd < 0.5

6openNum=rand()%S.closeBoxNum;

7 S’ = addBox(S, openNum);

8else

9 closeNum = rand()%S.openBoxNum;

10 S’ = dropBox(S, closeNum);

11end

12S’ = FindBestNeighbor(S’);

13if f(S’) < f(S)

14S = S’;

15k = 1;

16else

17if iter < iterMax

18 iter = 0;

19 k = k + 1;

20end

21 end

22iter = iter + 1;

23Until k > kMax