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

Algorithm 1

HABP algorithm framework.

Input: two-echelon routing graph

Output: New solution

1. = InitialSolution;

2. for every node in : value(node) = STDistance(node);

3. for 1 to maxIterationNum do

4.  RandomRePath();

5. endfor;

6. return ;