Computer Engineering and Applications ›› 2021, Vol. 57 ›› Issue (16): 291-298.DOI: 10.3778/j.issn.1002-8331.2012-0337

Previous Articles    

Research on Multi-depot Vehicle Routing Problem Based on Joint Distribution Mode

FU Zhaohui, LIU Changshi   

  1. 1.Department of Software, Changsha Social Work College, Changsha 410004, China
    2.School of Management, Hunan University of Technology and Business, Changsha 410205, China
  • Online:2021-08-15 Published:2021-08-16



  1. 1.长沙民政职业技术学院 软件学院,长沙 410004
    2.湖南工商大学 工商管理学院,长沙 410205


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



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