Last mile delivery routing problem with some-day option

Stefan Voigt, Markus Frank and Heinrich Kuhn

European Journal of Operational Research, 2025, vol. 324, issue 2, 477-491

Abstract: E-commerce retailers are challenged to maintain cost-efficiency and customer satisfaction while pursuing sustainability, especially in the last mile. In response, retailers are offering a range of delivery speeds, including same-day and instant options. Faster deliveries, while trending, often increase costs and emissions due to limited planning time and reduced consolidation opportunities in the last mile. In contrast, this paper proposes the inclusion of a slower delivery option, termed some-day. Slowing down the delivery process allows for greater shipment consolidation, achieving cost savings and environmental goals simultaneously. We introduce the dynamic and stochastic some-day delivery problem, which accounts for a latest delivery day, customer time windows, and capacity limitations within a multi-period planning framework. Our solution approach is based on addressing auxiliary prize-collecting vehicle routing problems with time windows (PCVRPTW) on a daily basis, where the prize reflects the benefit of promptly serving the customer. We develop a hybrid adaptive large neighborhood search with granular insertion operators, outperforming existing metaheuristics for PCVRPTWs. Our numerical study shows significant cost savings with only small increases in delivery times compared to an earliest policy.

Keywords: Routing; E-commerce; Last mile delivery; Vehicle routing problem; Adaptive large neighborhood search (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221725000888
Full text for ScienceDirect subscribers only

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:eee:ejores:v:324:y:2025:i:2:p:477-491

DOI: 10.1016/j.ejor.2025.02.001

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().