Dynamic service area sizing in urban delivery
- PMID: 35971460
- PMCID: PMC9365926
- DOI: 10.1007/s00291-022-00666-z
Dynamic service area sizing in urban delivery
Abstract
We consider an urban instant delivery environment, e.g., meal delivery, in which customers place orders over the course of a day and are promised delivery within a short period of time after an order is placed. Deliveries are made using a fleet of vehicles, each completing one or more trips during the day. To avoid missing delivery time promises as much as possible, the provider manages demand by dynamically adjusting the size of the service area, i.e., the area in which orders can be delivered. The provider seeks to maximize the number of orders served while avoiding missed delivery time promises. We present three techniques to support the dynamic adjusting of the size of the service area which can be embedded in planning and execution tools that help the provider achieve its goal. First, we learn the functional dependency between expected demand and the service area that can be supported with the fleet of vehicles. Second, we use value function approximation to improve an initial service area sizing plan for the day based on expected demand. Finally, we introduce a correction mechanism to dynamically adjust the service area sizing plan in response to observed realized demand. Extensive computational experiments demonstrate the efficacy of the techniques and show that dynamic sizing of the service area can increase the number of orders served significantly without increasing the number of missed delivery time promises.
Keywords: Dynamic vehicle routing; Instant delivery; Meal delivery; Service area sizing; Uncertain demand.
© The Author(s) 2022.
Figures
References
-
- Alnaggar A, Gzara F, Bookbinder JH. Crowdsourced delivery: a review of platforms and academic literature. Omega. 2021;98:102–139. doi: 10.1016/j.omega.2019.102139. - DOI
-
- Azi N, Gendreau M, Potvin J-Y. A dynamic vehicle routing problem with multiple delivery routes. Ann Oper Res. 2012;199(1):103–112. doi: 10.1007/s10479-011-0991-3. - DOI
-
- Bent RW, Van Hentenryck P. Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper Res. 2004;52(6):977–987. doi: 10.1287/opre.1040.0124. - DOI
-
- Brinkmann J, Ulmer MW, Mattfeld DC. Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems. Comput Oper Res. 2019;106:260–279. doi: 10.1016/j.cor.2018.06.004. - DOI
LinkOut - more resources
Full Text Sources