Optimising parcel deliveries in London using dual-mode routing

Nguyen, T, Bektas, T ORCID: 0000-0003-0634-144X, Cherrett, T, Mcleod, F, Allen, J, Bates, O, Piotrowska, M, Piecyk, M, Friday, A and Wise, S
(2018) Optimising parcel deliveries in London using dual-mode routing. Journal of the Operational Research Society, 70 (6). pp. 998-1010.

[img] Text
JORS_dualmode_postprint_sys.pdf - Author Accepted Manuscript

Download (1MB)


Last-mile delivery operations are complex, and the conventional way of using a single mode of delivery (e.g. driving) is not necessarily an efficient strategy. This paper describes a two-level parcel distribution model that combines walking and driving for a single driver. The model aims to minimise the total travelling time by scheduling a vehicle’s routing and the driver’s walking sequence when making deliveries, taking decisions on parking locations into consideration. The model is a variant of the Clustered Travelling Salesman Problem with Time Windows, in which the sequence of visits within each cluster is required to form a closed tour. When applied to a case study of an actual vehicle round from a parcel carrier operating in London, savings of over 20% in the total operation time were returned over the current situation where 144 parcels were being delivered to 57 delivery locations.

Item Type: Article
Uncontrolled Keywords: Clustered travelling salesman problem, last-mile delivery, time windows
Depositing User: Symplectic Admin
Date Deposited: 30 Oct 2018 10:01
Last Modified: 19 Jan 2023 01:14
DOI: 10.1080/01605682.2018.1480906
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3027869