Computer Engineering and Applications ›› 2021, Vol. 57 ›› Issue (10): 225-232.DOI: 10.3778/j.issn.1002-8331.2101-0248

Previous Articles     Next Articles

Research on Multi-depots Vehicle Routing Problem with Semi-flexible Coverage Service

ZHANG Xiaonan, JIANG Shuai, NAN Jingwen   

  1. Mechanical and Electrical Engineering Institute, Shaanxi University of Science and Technology, Xi’an 710021, China
  • Online:2021-05-15 Published:2021-05-10



  1. 陕西科技大学 机电工程学院,西安 710021


To solve the?warehouse?explosion and delivery stagnation for last-mile logistics network with the soaring demand at the “Double 11” and “618”, this paper proposes a semi-flexible coverage service strategy which considers both the high solution quality and high system stability. As?a?result, the Multi-depots Vehicle Routing Problem with Semi-flexible Service(MVRP-SFS) is studied. Firstly, according to the geographical location information, this paper distinguishes all customer nodes into fixed coverage nodes and flexible coverage nodes. The fixed coverage nodes can only be served by one depot, while the flexible coverage nodes can be served by any one of multiple depots that allow to service cooperatively. Secondly, with the goal of minimizing the total cost, this paper establishes an MVRP-SFS model. Thirdly, this paper designs the genetic algorithm using Matlab compiler to solve the proposed model. Finally, the numerical experiments verify the effectiveness of the semi-flexible coverage service strategy.

Key words: multi-depots, vehicle routing problem, semi-flexible coverage service strategy, genetic algorithm



关键词: 多配送中心, 路线优化问题, 半柔性覆盖策略, 遗传算法