Skip to Main content Skip to Navigation
Journal articles

A Disruption Recovery Problem with Time Windows Change in the Last Mile Delivery of Online Shopping

Abstract : Frequent time window changing disruptions result in high secondary delivery rates in the last mile delivery. With the rapid growth of parcel volumes in online shopping, the time window changing disruptions could translate to substantial delivery cost-wastes. In recent years, customer pickup (CP), a new delivery mode that allows customers to pick up their parcels from shared delivery facilities, has provided a new way to deal with such disruptions. This study proposed a disruption recovery problem with time windows change in the last mile delivery in which customers can be served through home delivery (HD) or CP. A variant variable neighborhood descent (VVND) algorithm was presented to solve the problem. Computational experiments based on a set of instances were tested, and results were compared with other heuristics in the literature, which have affirmed the competitiveness of the model and algorithm.
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03675640
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Monday, May 23, 2022 - 11:52:27 AM
Last modification on : Tuesday, May 24, 2022 - 3:43:09 AM

File

2096416.pdf
Publication funded by an institution

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Collections

Citation

Li Jiang, Changyong Liang, Junfeng Dong, Wenxing Lu, Marko Mladenovic. A Disruption Recovery Problem with Time Windows Change in the Last Mile Delivery of Online Shopping. Mathematical Problems in Engineering, Hindawi Publishing Corporation, 2018, 2018, pp.2096416. ⟨10.1155/2018/2096416⟩. ⟨hal-03675640⟩

Share

Metrics

Record views

2

Files downloads

5