Abstract
Considering autonomous delivery robots in urban logistics has attracted a great deal of attention in recent years. In the meantime, new technology has led to new operational challenges, such as the routing and scheduling of vehicles and delivery robots together that are currently outside the logistics service providers’ capability. In this paper, a vehicle routing problem with time windows and delivery robots (VRPTWDR) as a variant of the classical VRP is studied. The investigated problem is concerned with the routing of a set of delivery vans equipped with a number of self-driving parcel delivery robots. To tackle the VRPTWDR, an Adaptive Large Neighborhood Search heuristic algorithm is developed. Experiments show the performance and effectiveness of the algorithm for solving the VRPTWDR, and provide insights on the use of self-driving parcel delivery robots as an alternative last mile service.
| Original language | British English |
|---|---|
| Pages (from-to) | 1164-1180 |
| Number of pages | 17 |
| Journal | European Journal of Operational Research |
| Volume | 294 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1 Nov 2021 |
Keywords
- Delivery robot
- Metaheuristic algorithm
- Transportation
- Vehicle routing problem