Abstract: With the continuous deepening of internet commercial iteration, more and more companies tend to resolve the contradiction between distribution distance and timeliness of distribution from the perspective of putting forward commodity. Therefore, based on the dynamic vehicle scheduling problem with inventory synergetic customer (DVRP-ISC), this paper designs the method of selecting the customer of the coordinated sub-warehouse with the characteristics of regional division, and establishes the multi-stage dynamic distribution network optimization model. In view of the particularity of the research problem, a multi-stage two-level network collaborative distribution path optimization algorithm is designed. Finally, the model, algorithm performance, and their scalability are verified by simulating examples, and the customized and benchmark examples.

Key words: two-echelon dynamic vehicle routing problem, inventory synergy, generic-tabu search, multi-stage scheduling

摘要： 随着互联网商业迭代的不断深化,越来越多的企业倾向于从商品前置视角解决配送距离与配送时效性的矛盾。为此,本文研究基于客户协同分仓备货的动态车辆调度问题(Dynamic Vehicle Routing Problem with Inventory Synergetic Customer, DVRP-ISC),设计考虑区域分异特征的协同分仓客户选择方法,建立多阶段动态配送网络优化模型。鉴于研究问题的特殊性,设计多阶段两级网络协同配送路径优化算法;最后,以仿真算例、自定义算例集和基准算例,验证所提模型和算法性能及其拓展性。

关键词: 两级动态车辆路径问题, 仓储协同, 遗传-禁忌搜索, 多阶段调度