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

Li Jiang, Changyong Liang, Junfeng Dong, Wenxing Lu and Marko Mladenovic

Mathematical Problems in Engineering, 2018, vol. 2018, 1-10

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.

Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2018/2096416.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2018/2096416.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:2096416

DOI: 10.1155/2018/2096416

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().