期刊
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
卷 70, 期 6, 页码 998-1010出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/01605682.2018.1480906
关键词
Clustered travelling salesman problem; last-mile delivery; time windows
资金
- EPSRC [EP/N02222X/1]
- EPSRC [EP/N02222X/1] Funding Source: UKRI
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据