关键词: 循环取货, 动态时间窗, 满载提取, 启发式节约算法

Abstract: To seek the optimal path for the vehicles to take delivery of auto parts under the Milk-run, a modeling idea that each components supplier's spare parts were delivered by the way of circular and batch delivery to make as full use of the vehicle as possible was put forward. The optimizing model of vehicle routing problem was established with the constraints of vehicle cubage, arriving time window, supplier supplying dynamic time window and maximum running distance. After that, a heuristic saving algorithm (or C-W algorithm) was designed to provide a solution to the model. Finally, one example was given to prove the validity of the model and algorithm.

Key words: Milk-run, dynamic time window, full-taking delivery, heuristic Clark-Wright (C-W) algorithm