Chen, Cheng, Demir, Emrah ![]() ![]() |
![]() |
PDF
- Accepted Post-Print Version
Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (909kB) |
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.
Item Type: | Article |
---|---|
Date Type: | Publication |
Status: | Published |
Schools: | Business (Including Economics) |
Publisher: | Elsevier |
ISSN: | 0377-2217 |
Date of First Compliant Deposit: | 8 February 2021 |
Date of Acceptance: | 7 February 2021 |
Last Modified: | 06 Nov 2023 23:13 |
URI: | https://orca.cardiff.ac.uk/id/eprint/138362 |
Citation Data
Cited 77 times in Scopus. View in Scopus. Powered By Scopus® Data
Actions (repository staff only)
![]() |
Edit Item |