Models and Methods for Two-Echelon Location Routing Problem with Time Constraints in City Logistics

Algorithm 3

RandomRePath.

Input: Two-echelon routing graph , Current solution

Output: New solution

1. Compute the initial value for every node by Formula (15)

2. for 1 to maxIterationNum do

3. = ChooseCustomer();

4.n = ChooseLinkNode();

5.if (n ∈ C)

6.AddPath();

7.if(acceptPath() == true)

8.uptate();

9.Endif;

10.else

11.RePath();

12.if(acceptPath() == true)

13.uptate();

14.Endif;

15.Endif;

16. Endfor;

14. return ;