On-Demand Delivery from Stores: Dynamic Dispatching and Routing with Random Demand

References

• Adulyasak Y, Jaillet P (2016) Models and algorithms for stochastic and robust vehicle routing with deadlines. Transportation Sci. 50(2):608–626.Link, Google Scholar
• Applegate D, William C, David J, Neil S (2010) Using large-scale computation to estimate the Beardwood-Halton-Hammersley TSP constant. Presentation, 42 Simpósio Brasileiro de Pesquisa Operacional, September 2, Bento Gonçalves, Rio Grande do Sul, Brazil.Google Scholar
• Azi N, Gendreau M, Potvin J-Y (2010) An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur. J. Oper. Res. 202(3):756–763.Crossref, Google Scholar
• Azi N, Gendreau M, Potvin J-Y (2012) A dynamic vehicle routing problem with multiple delivery routes. Ann. Oper. Res. 199(1):103–112.Crossref, Google Scholar
• Bahrami S, Nourinejad M, Yin Y, Wang H (2021) The three-sided market of on-demand delivery. Preprint, submitted October 18, http://dx.doi.org/10.2139/ssrn.3944559.Google Scholar
• Beardwood J, Halton JH, Hammersley JM (1959) The shortest path through many points. Math. Proc. Cambridge Philos. Soc. 55(4):299–327.Google Scholar
• Bertsimas DJ (1992) A vehicle routing problem with stochastic demand. Oper. Res. 40(3):574–585.Link, Google Scholar
• Bertsimas DJ, Van Ryzin G (1993) Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles. Oper. Res. 41(1):60–76.Link, Google Scholar
• Chen M, Hu M (2020) Courier dispatch in on-demand delivery. Preprint, submitted October 1, https://dx.doi.org/10.2139/ssrn.3675063.Google Scholar
• CNBC (2018) Inside Alibaba’s new kind of superstore: Robots, apps and overhead conveyor belts. Accessed March 31, 2022, https://www.cnbc.com/2018/08/30/inside-hema-alibabas-new-kind-of-superstore-robots-apps-and-more.html.Google Scholar
• CNBC (2019) Amazon is making two-hour grocery delivery free for all Prime members. Accessed August 5, 2021, https://www.cnbc.com/2019/10/29/amazon-is-making-two-hour-grocery-delivery-free-for-all-prime-members.html.Google Scholar
• CNBC (2020) Domino’s Pizza U.S. same-store sales soar 16% as more consumers order delivery. Accessed August 20, 2020, https://www.cnbc.com/2020/07/16/dominos-pizza-dpz-q2-2020-earnings-beat.html.Google Scholar
• Cortés CE, Sáez D, Núñez A, Muñoz-Carpintero D (2009) Hybrid adaptive predictive control for a dynamic pickup and delivery problem. Transportation Sci. 43(1):27–42.Link, Google Scholar
• Dantzig GB, Ramser JH (1959) The truck dispatching problem. Management Sci. 6(1):80–91.Link, Google Scholar
• Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44(3):216–229.Crossref, Google Scholar
• Goodson JC, Ohlmann JW, Thomas BW (2013) Rollout policies for dynamic solutions to the multivehicle routing problem with stochastic demand and duration limits. Oper. Res. 61(1):138–154.Link, Google Scholar
• Goodson JC, Thomas BW, Ohlmann JW (2016) Restocking-based rollout policies for the vehicle routing problem with stochastic demand and duration limits. Transportation Sci. 50(2):591–607.Link, Google Scholar
• Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. Desaulniers G, Desrosiers J, Solomon MM, eds. Column Generation (Springer, Boston), 33–65.Crossref, Google Scholar
• Klapp MA, Erera AL, Toriello A (2018a) The dynamic dispatch waves problem for same-day delivery. Eur. J. Oper. Res. 271(2):519–534.Crossref, Google Scholar
• Klapp MA, Erera AL, Toriello A (2018b) The one-dimensional dynamic dispatch waves problem. Transportation Sci. 52(2):402–415.Link, Google Scholar
• Laporte G, Louveaux F, Mercure H (1992) The vehicle routing problem with stochastic travel times. Transportation Sci. 26(3):161–170.Link, Google Scholar
• Lei H, Laporte G, Guo B (2012) A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times. TOP 20(1):99–118.Crossref, Google Scholar
• Lei YM, Jasin S, Wang J, Deng H, Putrevu J (2020) Dynamic workforce acquisition for crowdsourced last-mile delivery platforms. Preprint, submitted March 3, http://dx.doi.org/10.2139/ssrn.3532844.Google Scholar
• Liu S, He L, Shen Z-JM (2021) On-time last-mile delivery: Order assignment with travel-time predictors. Management Sci. 67(7):4095–4119.Link, Google Scholar
• Luo Z, Qin H, Lim A (2014) Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints. Eur. J. Oper. Res. 234(1):49–60.Crossref, Google Scholar
• Martinelli R, Pecin D, Poggi M (2014) Efficient elementary and restricted non-elementary route pricing. Eur. J. Oper. Res. 239(1):102–111.Crossref, Google Scholar
• McDelivery (2020) McDelivery 30 minutes guarantee. Accessed August 20, 2020, https://www.4008-517-517.cn/cn/?locale=en.Google Scholar
• Muritiba AEF, Bonates TO, Da Silva SO, Iori M (2021) Branch-and-cut and iterated local search for the weighted k-traveling repairman problem: An application to the maintenance of speed cameras. Transportation Sci. 55(1):139–159.Link, Google Scholar
• Nucamendi-Guillén S, Martínez-Salazar I, Angel-Bello F, Moreno-Vega JM (2016) A mixed integer formulation and an efficient metaheuristic procedure for the k-travelling repairmen problem. J. Oper. Res. Soc. 67(8):1121–1134.Crossref, Google Scholar
• Onder G, Kara I, Derya T (2017) New integer programming formulation for multiple traveling repairmen problem. Transportation Res. Procedia 22:355–361.Crossref, Google Scholar
• Pillac V, Gendreau M, Guéret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1):1–11.Crossref, Google Scholar
• Powell WB (2011) Approximate Dynamic Programming: Solving the Curses of Dimensionality, vol. 842 (John Wiley & Sons, New York).Crossref, Google Scholar
• Powell WB (2019) A unified framework for stochastic optimization. Eur. J. Oper. Res. 275(3):795–821.Crossref, Google Scholar
• Rana P, Haddon H (2021) Restaurants and startups try to outrun Uber Eats and DoorDash. Accessed December 1, 2021, https://www.wsj.com/articles/restaurants-and-startups-try-to-outrun-uber-eats-and-doordash-11613903401.Google Scholar
• Reyes D, Erera AL, Savelsbergh M, Sahasrabudhe S, O’Neil R (2018) The meal delivery routing problem. Accessed November 1, 2022, https://optimization-online.org/?p=15139.Google Scholar
• Righini G, Salani M (2006) Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim. 3(3):255–273.Crossref, Google Scholar
• Righini G, Salani M (2008) New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3):155–170.Crossref, Google Scholar
• South China Morning Post (2019) Citic Capital, McDonald’s majority owner in China, says online food delivery services is burger chain’s biggest revenue driver. Accessed August 20, 2020, https://www.scmp.com/business/companies/article/3030276/citic-capital-mcdonalds-majority-owner-china-says-online-food.Google Scholar
• Statista (2020) Online food delivery. Accessed August 20, 2020, https://www.statista.com/outlook/374/100/online-food-delivery/worldwide.Google Scholar
• Steele JM (1981) Subadditive Euclidean functionals and nonlinear growth in geometric probability. Ann. Probab. 9(3):365–376.Crossref, Google Scholar
• Stratistics Market Research Consulting (2020) Online grocery: Global market outlook (2018-2027). Accessed August 20, 2020, https://www.researchandmarkets.com/reports/5050772/online-grocery-global-market-outlook-2018-2027.Google Scholar
• Ulmer MW (2020) Dynamic pricing and routing for same-day delivery. Transportation Sci. 54(4):1016–1033.Link, Google Scholar
• Ulmer MW, Goodson JC, Mattfeld DC, Hennig M (2019a) Offline–online approximate dynamic programming for dynamic vehicle routing with stochastic requests. Transportion Sci. 53(1):185–202.Link, Google Scholar
• Ulmer MW, Savelsbergh M (2020) Workforce scheduling in the era of crowdsourced delivery. Transportation Sci. 54(4):1113–1133.Link, Google Scholar
• Ulmer MW, Goodson JC, Mattfeld DC, Thomas BW (2020) On modeling stochastic dynamic vehicle routing problems. EURO J. Transportation Logist. 9(2):100008.Crossref, Google Scholar
• Ulmer MW, Thomas BW, Campbell AM, Woyak N (2021) The restaurant meal delivery problem: Dynamic pickup and delivery with deadlines and random ready times. Transportation Sci. 55(1):75–100.Link, Google Scholar
• Ulmer MW, Thomas BW, Mattfeld DC (2019b) Preemptive depot returns for dynamic same-day delivery. EURO J. Transportation Logist. 8(4):327–361.Crossref, Google Scholar
• US Foods (2019) New study shows what consumers crave in a food delivery service. Accessed August 20, 2020, https://www.usfoods.com/our-services/business-trends/2019-food-delivery-statistics.html.Google Scholar
• Voccia SA, Campbell AM, Thomas BW (2019) The same-day delivery problem for online purchases. Transportation Sci. 53(1):167–184.Link, Google Scholar
• Yildiz B, Savelsbergh M (2019) Provably high-quality solutions for the meal delivery routing problem. Transportation Sci. 53(5):1372–1388.Link, Google Scholar
• Yildiz B, Savelsbergh M (2020) Pricing for delivery time flexibility. Transportation Res. Part B: Methodological 133:230–256.Crossref, Google Scholar