A Prescriptive Machine Learning Method for Courier Scheduling on Crowdsourced Delivery Platforms

References

• Alnaggar A, Gzara F, Bookbinder JH (2020) Distribution planning with random demand and recourse in a transshipment network. EURO J. Transportation Logist. 9(1):100007.Crossref, Google Scholar
• Alnaggar A, Gzara F, Bookbinder JH (2021) Crowdsourced delivery: A review of platforms and academic literature. Omega 98:102139.Crossref, Google Scholar
• Arslan AM, Agatz N, Kroon L, Zuidwijk R (2019) Crowdsourced delivery—A dynamic pickup and delivery problem with ad hoc drivers. Transportation Sci. 53(1):222–235.Link, Google Scholar
• Bent RW, Van Hentenryck P (2004) Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper. Res. 52(6):977–987.Link, Google Scholar
• Bertsimas D, Kallus N (2020) From predictive to prescriptive analytics. Management Sci. 66(3):1025–1044.Link, Google Scholar
• Cao J, Olvera-Cravioto M, Shen ZJ (2020) Last-mile shared delivery: A discrete sequential packing approach. Math. Oper. Res. 45(4):1466–1497.Link, Google Scholar
• Clement J (2019) United States: Retail e-commerce sales 2017–2023. Accessed May 18, 2022, https://www.statista.com/statistics/272391/us-retail-e-commerce-sales-forecast.Google Scholar
• Dayarian I, Savelsbergh M (2020) Crowdshipping and same-day delivery: Employing in-store customers to deliver online orders. Production Oper. Management 29(9):2153–2174.Crossref, Google Scholar
• Gurvich I, Lariviere M, Moreno A (2019) Operations in the on-demand economy: Staffing services with self-scheduling capacity. Sharing Economy (Springer International Publishing, Cham, Switzerland), 249–278.Crossref, Google Scholar
• Hornik K, Stinchcombe M, White H (1989) Multilayer feedforward networks are universal approximators. Neural Networks 2(5):359–366.Crossref, Google Scholar
• Klapp MA, Erera AL, Toriello A (2018) The one-dimensional dynamic dispatch waves problem. Transportation Sci. 52(2):402–415.Link, Google Scholar
• Kleywegt AJ, Shapiro A, Homem-de-Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.Crossref, Google Scholar
• Lee A, Savelsbergh M (2015) Dynamic ridesharing: Is there a role for dedicated drivers? Transportation Res. Part B Methodological 81(2):483–497.Crossref, Google Scholar
• Li B, Krushinsky D, Van Woensel T, Reijers HA (2016) The share-a-ride problem with stochastic travel times and stochastic delivery locations. Transportation Res. Part C Emerging Tech. 67:95–108.Crossref, Google Scholar
• Liu S, He L, Shen ZJM (2020) On-time last-mile delivery: Order assignment with travel-time predictors. Management Sci. 67(7):4095–4119.Link, Google Scholar
• Long Y, Lee LH, Chew EP (2012) The sample average approximation method for empty container repositioning with uncertainties. Eur. J. Oper. Res. 222(1):65–75.Crossref, Google Scholar
• Manyika J, Lund S, Bughin J, Robinson K, Mischke J, Mahajan D (2016) Independent work: Choice, necessity, and the gig economy. Accessed May 18, 2022, https://www.mckinsey.com/featured-insights/employment-and-growth/independent-work-choice-necessity-and-the-gig-economy.Google Scholar
• Ruszczyński A, Shapiro A (2003) Stochastic programming models. Handbooks in Operations Research and Management Science, vol. 10 (Elsevier, Amsterdam), 1–64.Google Scholar
• Sampaio A, Savelsbergh M, Veelenturf L, van Woensel T (2019) Crowd-based city logistics. Faulin J, Grasman SE, Juan AA, Hirsch P, eds. Sustainable Transportation and Smart Logistics (Elsevier, Amsterdam), 381–400.Crossref, Google Scholar
• Santini A, Viana A, Klimentova X, Pedroso JP (2022) The probabilistic travelling salesman problem with crowdsourcing. Comput. Oper. Res. 142:105722.Google Scholar
• Savelsbergh MW, Ulmer MW (2022) Challenges and opportunities in crowdsourced delivery planning and operations. 4OR-Q J. Oper. Res. 20:1–21.Crossref, Google Scholar
• Schütz P, Tomasgard A, Ahmed S (2009) Supply chain design under uncertainty using sample average approximation and dual decomposition. Eur. J. Oper. Res. 199(2):409–419.Crossref, Google Scholar
• Srour FJ, Agatz N, Oppen J (2018) Strategies for handling temporal uncertainty in pickup and delivery problems with time windows. Transportation Sci. 52(1):3–19.Link, Google Scholar
• Stroh AM, Erera AL, Toriello A (2021) Tactical design of same-day delivery systems. Management Sci., ePub ahead of print September 14, https://doi.org/10.1287/mnsc.2021.4041.Google Scholar
• Train KE (2009) Discrete Choice Methods with Simulation (Cambridge University Press, Cambridge, England).Crossref, Google Scholar
• Ulmer MW (2020) Dynamic pricing and routing for same-day delivery. Transportation Sci. 54(4):1016–1033.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
• Verweij B, Ahmed S, Kleywegt AJ, Nemhauser G, Shapiro A (2003) The sample average approximation method applied to stochastic routing problems: A computational study. Comput. Optim. Appl. 24(2):289–333.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
• Yildiz B, Savelsbergh M (2019) Service and capacity planning in crowd-sourced delivery. Transportation Res. Part C Emerging Tech. 100:177–199.Crossref, Google Scholar
• Zebra Technologies (2019) The future of fulfillment vision study. Accessed May 18, 2022, https://www.zebra.com/content/dam/zebra_new_ia/en-us/solutions-verticals/vertical-solutions/retail/vision-study/fulfillment-vision-study-report-en-us.pdf.Google Scholar