Multi-depot routing problem with van-based driverless vehicles

Abstract

In order to strengthen the coordination between different delivery participants and means of transport, this work proposes one extension of multi-depot routing problems where vans and driverless vehicles are used in combination during the delivery. The operation process mainly includes two parts. One is that, vans carry several driverless vehicles and goods, and drop off or pick up driverless vehicles at stops. Another is that, driverless vehicles departing directly from depots and dropped off by vans deliver goods to customers in cooperation. During the delivery, vans and driverless vehicles are in close cooperation through the proposed multi-depot joint distribution and the proposed van-van joint distribution. By the two modes, one van can depart from one depot and return to another depot, and one driverless vehicle can be set off by one van at one stop and be picked up by another van at another stop. This multi-depot routing problem with van-based driverless vehicles is formulated as a mixed integer programming model which can be solved by a designed heuristic algorithm. The sensitivity analyses about the maximum number of driverless vehicles in one van and the maximum traveling time of driverless vehicles are also performed. The results reveal that they have limited effects on the delivery cost and the application of the two modes. In addition, the experimental results demonstrate that the application of the two modes is affected by the distribution of depots and stops.