Provably Good Region Partitioning for On-Time Last-Mile Delivery

References

• Ansari S, Başdere M, Li X, Ouyang Y, Smilowitz K (2018) Advancements in continuous approximation models for logistics and transportation systems: 1996–2016. Transportation Res. Part B: Methodological 107:229–252.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
• Banerjee D, Erera AL, Toriello A (2022) Fleet sizing and service region partitioning for same-day delivery systems. Transportation Sci. 56(5):1327–1347.Google Scholar
• Banerjee D, Erera AL, Stroh AM, Toriello A (2023) Who has access to e-commerce and when? Time-varying service regions in same-day delivery. Transportation Res. Part B: Methodological 170:148–168.Google Scholar
• Beardwood J, Halton JH, Hammersley JM (1959) The shortest path through many points. Mathematical Proceedings of the Cambridge Philosophical Society, vol. 55 (Cambridge University Press, Cambridge, UK), 299–327.Google Scholar
• Bereg S, Bose P, Kirkpatrick D (2006) Equitable subdivisions within polygonal regions. Comput. Geometry 34(1):20–27.Crossref, Google Scholar
• Bertsimas DJ, Van Ryzin G (1993a) Stochastic and dynamic vehicle routing in the euclidean plane with multiple capacitated vehicles. Oper. Res. 41(1):60–76.Link, Google Scholar
• Bertsimas DJ, Van Ryzin G (1993b) Stochastic and dynamic vehicle routing with general demand and interarrival time distributions. Adv. Appl. Probability 25(4):947–978.Crossref, Google Scholar
• Bespamyatnikh S, Kirkpatrick D, Snoeyink J (2000) Generalizing ham sandwich cuts to equitable subdivisions. Discrete Comput. Geometry 24(4):605–622.Crossref, Google Scholar
• Beyer WA, Zardecki A (2004) The early history of the ham sandwich theorem. Amer. Math. Monthly 111(1):58–61.Crossref, Google Scholar
• Cao J, Qi W (2023) Stall economy: The value of mobility in retail on wheels. Oper. Res. 71(2):708–726.Google Scholar
• Cao J, Olvera-Cravioto M, Shen Z-J (2020) Last-mile shared delivery: A discrete sequential packing approach. Math. Oper. Res. 45(4):1466–1497.Link, Google Scholar
• Carlsson JG (2012) Dividing a territory among several vehicles. INFORMS J. Comput. 24(4):565–577.Link, Google Scholar
• Carlsson JG, Delage E (2013) Robust partitioning for stochastic multivehicle routing. Oper. Res. 61(3):727–744.Link, Google Scholar
• Carlsson JG, Devulapalli R (2013) Dividing a territory among several facilities. INFORMS J. Comput. 25(4):730–742.Link, Google Scholar
• Carlsson JG, Behroozi M, Mihic K (2018) Wasserstein distance and the distributionally robust tsp. Oper. Res. 66(6):1603–1624.Link, Google Scholar
• Chen M, Hu M (2023) Courier dispatch in on-demand delivery. Management Sci., ePub ahead of print July 21, https://doi.org/10.1287/mnsc.2023.4858.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
• Daganzo CF (2005) Logistics Systems Analysis (Springer Science & Business Media, Boston, MA).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
• Haimovich M, Rinnooy Kan AHG (1985) Bounds and heuristics for capacitated routing problems. Math. Oper. Res. 10(4):527–542.Link, Google Scholar
• Huang Y, Zhao L, Powell WB, Tong Y, Ryzhov IO (2019) Optimal learning for urban delivery fleet allocation. Transportation Sci. 53(3):623–641.Link, Google Scholar
• Kinsey LC (2012) Topology of Surfaces (Springer Science & Business Media, Boston, MA).Google Scholar
• Klapp MA, Erera AL, Toriello A (2018) The dynamic dispatch waves problem for same-day delivery. Eur. J. Oper. Res. 271(2):519–534.Crossref, Google Scholar
• Liu S, Luo Z (2022) On-demand delivery from stores: Dynamic dispatching and routing with random demand. Manufacturing Service Oper. Management 25(2):595–612.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
• Lo C-Y, Matoušek J, Steiger W (1994) Algorithms for ham-sandwich cuts. Discrete Comput. Geometry 11(4):433–452.Crossref, Google Scholar
• Mandelbaum A, Reiman MI (1998) On pooling in queueing networks. Management Sci. 44(7):971–981.Link, Google Scholar
• McDelivery (2021) Mcdelivery 30 minutes guarantee. Accessed August 5, 2021, https://mcd.cn/.Google Scholar
• Pavone M, Frazzoli E, Bullo F (2010) Adaptive and distributed algorithms for vehicle routing in a stochastic and dynamic environment. IEEE Trans. Automated Control 56(6):1259–1274.Crossref, Google Scholar
• PwC (2021) The global consumer: Changed for good. Accessed August 5, 2021, https://www.pwc.com/gx/en/consumer-markets/consumer-insights-survey/2021/gcis-june-2021.pdf.Google Scholar
• Qadri R (2020) Delivery platform algorithms don’t work without drivers’ deep local knowledge. Accessed August 5, 2021, https://slate.com/technology/2020/12/gojek-grab-indonesia-delivery-platforms-algorithms.html.Google Scholar
• Qi W, Li L, Liu S, Shen Z-JM (2018) Shared mobility for last-mile delivery: Design, operational prescriptions, and environmental impact. Manufacturing Service Oper. Management 20(4):737–751.Link, Google Scholar
• Quarteroni A, Sacco R, Saleri F (2010) Numerical Mathematics (Springer, Berlin, Heidelberg).Google Scholar
• Rana P, Haddon H (2021) Doordash and Uber eats are hot. They’re still not making money. Accessed August 5, 2021, https://www.wsj.com/articles/doordash-and-uber-eats-are-hot-theyre-still-not-making-money-11622194203.Google Scholar
• Rana P, Kang J (2021) For Doordash and Uber eats, the future is everything in about an hour. Accessed August 5, 2021, https://www.wsj.com/articles/for-doordash-and-uber-eats-the-future-is-everything-in-about-an-hour-11622453401.Google Scholar
• Reyes D, Erera A, Savelsbergh M, Sahasrabudhe S, O’Neil R (2018) The Meal Delivery Routing Problem (Optimization Online).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 5, 2021, https://www.scmp.com/business/companies/article/3030276/citic-capital-mcdonalds-majority-owner-china-says-online-food.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, Thomas BW (2020) On modeling stochastic dynamic vehicle routing problems. EURO J. Transportation Logist. 9(2):100008.Crossref, 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
• Zhong H, Hall RW, Dessouky M (2007) Territory planning and vehicle dispatching with driver learning. Transportation Sci. 41(1):74–89.Link, Google Scholar