A Disruption Recovery Problem with Time Windows Change in the Last Mile Delivery of Online Shopping
Open Access
- 10 December 2018
- journal article
- research article
- Published by Hindawi Limited in Mathematical Problems in Engineering
- 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.Keywords
Funding Information
- Fundamental Research Funds for the Central Universities (71331002, 71502047, 71601061, 71771077, 17YJA630037, 2016YFC0803203, JS2017HGXJ0044, 45000-411104/005, 1808085QG229)
This publication has 24 references indexed in Scilit:
- Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problemEuropean Journal of Operational Research, 2014
- Variable neighborhood search for location routingComputers & Operations Research, 2013
- The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shippingEuropean Journal of Operational Research, 2013
- A recovery model for combinational disruptions in logistics delivery: Considering the real-world participatorsInternational Journal of Production Economics, 2012
- Disruption management of the vehicle routing problem with vehicle breakdownJournal of the Operational Research Society, 2011
- A large neighbourhood search heuristic for the aircraft and passenger recovery problem4OR, 2010
- A simulated annealing heuristic for the capacitated location routing problemComputers & Industrial Engineering, 2010
- A variable neighborhood search heuristic for periodic routing problemsEuropean Journal of Operational Research, 2009
- Real-time vehicle rerouting problems with time windowsEuropean Journal of Operational Research, 2009
- Vehicle routing and scheduling with dynamic travel timesComputers & Operations Research, 2006