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

Li Jiang (1) , Changyong Liang (1) , Junfeng Dong (1) , Wenxing Lu (1) , Marko Mladenovic (2)

1 HFUT - Hefei University of Technology
2 LAMIH - Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201

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.

Domaines: Recherche opérationnelle [math.OC]

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, 2018, 2018, pp.2096416. ⟨10.1155/2018/2096416⟩. ⟨hal-03675640⟩