Abstract:

The Multi-depot Vehicle Routing Problem（MDVRP） based on joint distribution mode is studied. Firstly, by considering the change of customer service relationship and the heterogeneity of customer demand, a joint distribution mode is designed to share customer demand, vehicles and logistics centers. Then, an MDVRP model is built by considering vehicle capacity, fuel consumption, carbon emissions, maximum driving time, customer demand and service time. The goal of the MDVRP model is to minimize total distribution cost. An improved ant colony algorithm is designed to solve the problem. Finally, simulation experiments are carried out with multiple types of instances. The results show that the joint distribution mode can effectively avoid unreasonable phenomena such as cross-distribution and roundabout transportation, reduce logistics costs, shorten vehicle driving distance, reduce vehicle carbon emissions, and promote the harmonious development of logistics and environment.

Key words: joint distribution, multi-depot, vehicle routing problem, improved ant colony algorithm

摘要：

研究多物流中心共同配送的车辆路径问题。首先考虑客户服务关系变化与客户需求的异质性情况，设计一种共享客户需求、配送车辆与物流中心的共享物流模式；再综合考虑车辆容量、油耗、碳排放、最长行驶时间、客户需求量与服务时间等因素，以总成本最小为目标构建多物流中心共同配送的车辆路径规划模型，并设计一种改进蚁群算法进行求解；最后采用多类型算例进行仿真实验，结果表明共享物流模式能有效避免交叉配送与迂回运输等不合理现象，降低物流成本，缩短车辆行驶距离，减少车辆碳排放，促进物流与环境的和谐发展。

关键词: 共同配送, 多物流中心, 车辆路径问题, 改进蚁群算法