关键词: 多货品, 取送货, 调货, 时间窗, 邻域搜索

Abstract: In order to fulfill the multi-commodity sales demand of fast-fashion chain stores, load capacity restriction of vehicles, multiple commodities, transshipment, service time window of stores and other factors should be considered. In this paper, the multi-commodity pickup and delivery vehicle routing problem with time windows and transshipment is studied. In order to effectively reduce inventory management and transshipment cost, it is usually encouraged to allocate goods between stores and control the number of vehicles used. In view of this, this paper first tries to minimize the number of vehicles used. Then, it minimizes the transshipment cost (transportation cost and warehouse handling cost). After that, it formulates a mixed integer programming model and designed a two-stage search algorithm by utilizing the shortest route insertion rule to generate the initial solution, and combining 8 neighborhood operators to generate neighborhood solutions. The results of benchmark instances indicate that the algorithm outperforms other existing algorithms in literature. Furthermore, 72 test instances are generated based on the actual operation data of a female shoe chain store. The computational results show that the quality of the solution and efficiency of the algorithm are better than those of the mixed integer programming model.

Key words: multi-commodity, pickup and delivery, transshipment, time windows, neighborhood search