Abstract: For urban goods distribution, there often exists delivery time uncertainty. It is a challenging issue to deal with such a timerelated disturbance. Aiming at minimizing the effect of such disturbance, this paper conducts a study on this issue. This problem is formulated into an integer programming model. Because of the combinatorial nature, then, a heuristic that based on human experience is presented. This algorithm is tested by using the benchmark problems in the literature and the results are compared with the existing algorithms. It is shown that the proposed algorithm outperforms the others in both performance and computational efficiency.

Key words: time-related disturbance, goods distribution, heuristic algorithm