Abstract: The multi-period dynamic vehicle routing problem(MPDVRP) belongs to the emerging problem of dynamic vehicle routing problem, which can be divided into single decision-making problem and multi-decision-making problem. Average distance strategy and cutting-and-batch TSP strategy were constructed for these two types of problems. The average distance strategy gives priority to customers those cannot be delayed, and then selects the customers those can be delayed according to the average path distance. In cutting-and-batch TSP strategy, the customers will be delayed or refused only in the last decision according to decision-making time limit. Simulations of the two strategies were carried out, and the numerical results show that the two strategies are both better than the existing strategies.

Key words: real-time optimization strategy, vehicle routing problem, dynamic, multi-period