主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2023, Vol. 31 ›› Issue (3): 48-57.doi: 10.16381/j.cnki.issn1003-207x.2022.0367

• Articles • Previous Articles    

Research on Routing Problem for Joint Delivery System Based on Multiple Trucks and Robots

GAO Jia-jing, ZHEN Lu   

  1. School of Management, Shanghai University, Shanghai 200444, China
  • Received:2022-02-26 Revised:2022-09-05 Published:2023-04-03
  • Contact: 镇璐 E-mail:lzhen@shu.edu.cn

Abstract: The business model of unmanned delivery has received attention, and unmanned delivery has provided a new direction for logistics distribution. As a new mode of unmanned delivery, the joint delivery mode of trucks and robots raises some scheduling problems in its application, such as complex path planning and strict time connection requirements of trucks and robots. The traditional scheduling mode is difficult to support the operation of the system. In the joint delivery system based on multiple trucks and robots, trucks serve as mobile depots for delivery robots and goods. Trucks do not serve customers, but all customers are served by delivery robots. To study the routing problem for joint delivery system based on multiple trucks and robots, a mixed integer programming (MIP) model with the objective of minimizing total cost including the traveling cost of truck, robot, and the cost of late delivery penalty is established. The MIP model makes the complex problem mathematical, considers customer time window, truck capacity and other factors, and studies the distribution decisions among different truck groups, the robot task allocation decisions, and the distribution path planning decisions of trucks and delivery robots in the joint delivery system based on multiple trucks and robots. A variable neighborhood search (VNS) algorithm is designed to solve the model, which provides an effective tool for solving practical problems. And the effectiveness of the model and algorithm is verified by numerical experiments. The experiment results show that the difference between the results of VNS algorithm and the optimal solution is 0.98% in small-scale experiments, and the calculation time is significantly shortened. In the case of large scale, the algorithm can optimize the rules up to 30.99%. Finally, through sensitivity analysis experiments, a scientific reference is provided for logistics companies to make macro-planning decisions such as the quantity allocation of trucks and the location of trucks.

Key words: delivery robot; joint delivery system; unmanned delivery; variable neighborhood search algorithm; mixed integer programming

CLC Number: