AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Article Link
Collect
Submit Manuscript
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Same-day delivery time-guarantee problem in online retail

Hossein FotouhiElise Miller-Hooks( )
Sid & Reva Dewberry Department of Civil, Environmental and Infrastructure Engineering, George Mason University, Fairfax, VA, 22030, USA
Show Author Information

Abstract

This study introduces the same-day delivery time-guarantee (SDDTG) problem for supporting online retail. In the SDDTG, orders are placed online and are processed and delivered from a depot to customer locations in the same day. The problem seeks optimal delivery time guarantees to offer customers as they consider making purchases to increase purchase decision likelihood while accounting for delivery-related, supply-side costs that can affect profits. Time guarantees are decision variables rather than parameters (as is typical) and are designed around anticipated customer satisfaction levels and purchase likelihoods. Delivery deadlines are not merely given to customers once they make their purchases, but rather the attractiveness of the offered delivery guarantees affects whether they make their purchases, i.e., whether demand is realized. The problem is conceptualized as a multi-stage, stochastic, mixed-integer program in which uncertainties associated with customer reaction to delivery time guarantee offers and their arrival over time are captured. Given a shrinking horizon over a fixed planning horizon, the multi-stage program is approximated by a series of two-stage programs. A parallelized progressive hedging solution methodology is proposed and insights from its application on a case study. The problem recognizes tradeoffs between meeting promised delivery times and capturing the market.

References

 

Agatz, N., Campbell, A., Fleischmann, M., Savelsbergh, M., 2011. Time slot management in attended home delivery. Transport. Sci. 45, 435–449.

 
Amazon annual reports, 2019. https://ir.aboutamazon.com/annual-reports.
 

Arslan, A.M., Agatz, N., Kroon, L., Zuidwijk, R., 2019. Crowdsourced delivery—a dynamic pickup and delivery problem with ad hoc drivers. Transport. Sci. 53, 222–235.

 

Azi, N., Gendreau, M., Potvin, J.Y., 2012. A dynamic vehicle routing problem with multiple delivery routes. Ann. Oper. Res. 199, 103–112.

 

Campbell, A.M., Savelsbergh, M.W.P., 2005. Decision support for consumer direct grocery initiatives. Transport. Sci. 39, 313–327.

 

Carøe, C.C., Schultz, R., 1999. Dual decomposition in stochastic integer programming. Oper. Res. Lett. 24, 37–45.

 
Cheng, S., 2018. Great Expectations: Shipping.
 
CX & Gen Z. Neopost Shipping. Clement, J., 2023. E-Commerce as Percentage of Total Retail Sales Worldwide from 2015 to 2027. https://www.statista.com/statistics/534123/e-commerce-share-of-retail-sales-worldwide.
 

Cosmi, M., Nicosia, G., Pacifici, A., 2019a. Scheduling for last-mile meal-delivery processes. IFAC-StudysOnLine 52, 511–516.

 

Cosmi, M., Oriolo, G., Piccialli, V., Ventura, P., 2019b. Single courier single restaurant meal delivery (witho3ut routing). Oper. Res. Lett. 47, 537–541.

 

Daganzo, C.F., 1984. The distance traveled to visit N points with a maximum of C stops per vehicle: an analytic model and an application. Transport. Sci. 18, 331–350.

 

Dayarian, I., Savelsbergh, M., 2020. Crowdshipping and same-day delivery: employing Instore customers to deliver online orders. Prod. Oper. Manag. 29, 2153–2174.

 

Fotouhi, H., Mori, N., Miller-Hooks, E., Sokolov, V., Sahasrabudhe, S., 2021. Assessing the effects of limited curbside pickup capacity in meal delivery operations for increased safety during a pandemic. Transp. Res. Record., 036119812199184

 

Gade, D., Hackebeil, G., Ryan, S.M., Watson, J.P., Wets, R.J.B., Woodruff, D.L., 2016. Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs. Math. Program. 157, 47–67.

 

Hernandez, F., Gendreau, M., Potvin, J.Y., 2017. Heuristics for tactical time slot management: a periodic vehicle routing problem view. Int. Trans. Oper. Res. 24, 1233–1252.

 

Kafle, N., Zou, B., Lin, J., 2017. Design and modeling of a crowdsource-enabled system for urban parcel relay and delivery. Transp. Res. Part B Methodol. 99, 62–82.

 

Klapp, M.A., Erera, A.L., Toriello, A., 2020. Request acceptance in same-day delivery. Transport. Res. Part E Logist Transp Rev 143, 102083.

 

Klein, R., Neugebauer, M., Ratkovitch, D., Steinhardt, C., 2019. Differentiated time slot pricing under routing considerations in attended home delivery. Transport. Sci. 53, 236–255.

 

Köhler, C., Ehmke, J.F., Campbell, A.M., 2020. Flexible time window management for attended home deliveries. Omega 91, 102023.

 

Laporte, G., Louveaux, F.V., 1993. The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13, 133–142.

 

Liao, W., Zhang, L., Wei, Z., 2020. Multi-objective green meal delivery routing problem based on a two-stage solution strategy. J. Clean. Prod. 258, 120627.

 

Liu, Y., 2019. An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones. Comput. Oper. Res. 111, 1–20.

 

Mittal, V., Kamakura, W.A., 2001. Satisfaction, repurchase intent, and repurchase behavior: investigating the moderating effect of customer characteristics. J. Mar. Res. 38, 131–142.

 

Pantuso, G., Boomsma, T.K., 2020. On the number of stages in multistage stochastic programs. Ann. Oper. Res. 292, 581–603.

 

Posselt, T., Gerstner, E., 2005. Pre-sale vs. Post-sale e-satisfaction: impact on repurchase intention and overall satisfaction. J. Interact. Market. 19, 35–47.

 
Reyes, D., Erera, A., Savelsbergh, M., Sahasrabudhe, S., O'Neil, R., 2018. The Meal Delivery Routing Problem. https://optimization-online.org/wp-content/uploads/2018/04/6571.pdf.
 

Rockafellar, R.T., Wets, R.J.B., 1991. Scenarios and policy aggregation in optimization under uncertainty. Mathematics 16, 119–147.

 
Siddique, H., 2017. Amazon Prime Could Face Investigation over Delivery Complaints. https://www.theguardian.com/technology/2017/dec/17/amazon-prime-investigation-delivery-complaints.
 

Steever, Z., Karwan, M., Murray, C., 2019. Dynamic courier routing for a food delivery service. Comput. Oper. Res. 107, 173–188.

 
Taylor, I., 2017. ASA Launches Formal Investigation into Amazon Prime Delivery Complaints. https://postandparcel.info/91978/news/e-commerce/asa-launchesformal-investigation-amazon-prime-delivery-complaints.
 
Tiku, N., 2020. Desperate Workers Rush to Delivery App Jobs to Find Low Pay and Punishing Rules. https://www.washingtonpost.com/technology/2020/05/23/gig-work-instacart-shipt-amazon-flex-doordash.
 

Ulmer, M., 2017. Delivery deadlines in same-day delivery. Logist Res. 10, 1–15.

 

Ulmer, M.W., Savelsbergh, M., 2020. Workforce scheduling in the era of crowdsourced delivery. Transport. Sci. 54, 1113–1133.

 

Ulmer, M.W., Streng, S., 2019. Same-Day delivery with pickup stations and autonomous vehicles. Comput. Oper. Res. 108, 1–19.

 

Ulmer, M.W., Thomas, B.W., 2018. Same-day delivery with heterogeneous fleets of drones and vehicles. Networks 72, 475–505.

 

Ulmer, M.W., Thomas, B.W., Campbell, A.M., Woyak, N., 2021. The restaurant meal delivery problem: dynamic pickup and delivery with deadlines and random ready times. Transport. Sci. 55, 75–100.

 

Voccia, S.A., Campbell, A.M., Thomas, B.W., 2019. The same-day delivery problem for online purchases. Transport. Sci. 53, 167–184.

 

Watson, J.P., Woodruff, D.L., 2011. Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems. Comput. Manag. Sci. 8, 355–370.

 

Yang, X., Strauss, A.K., 2017. An approximate dynamic programming approach to attended home delivery management. Eur. J. Oper. Res. 263, 935–945.

 

Yildiz, B., Savelsbergh, M., 2019a. Provably high-quality solutions for the meal delivery routing problem. Transport. Sci. 53, 1372–1388.

 

Yildiz, B., Savelsbergh, M., 2019b. Service and capacity planning in crowd-sourced delivery. Transport. Res. C Emerg. Technol. 100, 177–199.

Communications in Transportation Research
Article number: 100105
Cite this article:
Fotouhi H, Miller-Hooks E. Same-day delivery time-guarantee problem in online retail. Communications in Transportation Research, 2023, 3: 100105. https://doi.org/10.1016/j.commtr.2023.100105

231

Views

3

Crossref

3

Web of Science

3

Scopus

Altmetrics

Received: 26 June 2023
Revised: 07 September 2023
Accepted: 10 September 2023
Published: 27 November 2023
© 2023 The Authors.

This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

Return