Optimising parcel deliveries in London using dual-mode routing

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY(2019)

引用 22|浏览44
暂无评分
摘要
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.
更多
查看译文
关键词
Clustered travelling salesman problem,last-mile delivery,time windows
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要