Abstract
Attended home delivery (AHD) is a popular type of home delivery for which companies typically offer delivery time slots. The costs for offering time slots are often double compared to standard home delivery services (Yrjölä, 2001). To influence customers to choose a time slot that results in fewer travel costs, companies often give incentives (discounts) or penalties (delivery charges) depending on the costs of a time slot. The main focus of this paper is on determining the costs of a time slot and adjusting time slot pricing accordingly, i.e., dynamic pricing. We compare two time slot cost approximation methods, a cheapest insertion formula and a method employing random forests with a limited set of features. Our results show that time slot incentives have added value for practice. In a hypothetical situation where customers are infinitely sensitive to incentives, we can plan \(6\%\) more customers and decrease the per-customer travel costs by \(11\%\). Furthermore, we show that our method works especially well when customer locations are heavily clustered or when the area of operation is sparsely populated. For a realistic case of a European e-grocery retailer, we show that we can save approximately \(6\%\) in per-customer travel costs, and plan approximately \(1\%\) more customers when using our time slot incentive policy.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agatz, N., Campbell, A., Fleischmann, M., Nunen, J., Savelsbergh, M.: Revenue management opportunities for internet retailers. J. Revenue Pricing Manage. 12, 128–138 (2013). https://doi.org/10.1057/rpm.2012.51
Agatz, N., Campbell, A.M., Fleischmann, M., Savelsbergh, M.: Challenges and opportunities in attended home delivery. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces, vol. 43, pp. 379–396. Springer, Boston (2008). https://doi.org/10.1007/978-0-387-77778-8_17
Akamai: Akamai online retail performance report: milliseconds are critical (2017). https://www.akamai.com/uk/en/about/news/press/2017-press/akamai-releases-spring-2017-state-of-online-retail-performance-report.jsp
Akkerman, F., Mes, M.: Distance approximation to support customer selection in vehicle routing problems. Ann. Oper. Res., April 2022. https://doi.org/10.1007/s10479-022-04674-8
Akkerman, F.: Delivery cost approximations for dynamic time slot pricing, April 2021. http://essay.utwente.nl/86079/
Asdemir, K., Jacob, V.S., Krishnan, R.: Dynamic pricing of multiple home delivery options. Eur. J. Oper. Res. 196(1), 246–257 (2009). https://doi.org/10.1016/j.ejor.2008.03.005
Bai, J., Lu, F., Zhang, K., et al.: ONNX: Open neural network exchange (2019). https://github.com/onnx/onnx
Belobaba, P.: Air travel demand and airline seat inventory management. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge (1987)
Campbell, A., Savelsbergh, M.: Incentive schemes for attended home delivery services. Transp. Sci. 40, 327–341 (2006). https://doi.org/10.1287/trsc.1050.0136
Campbell, A.M., Savelsbergh, M.W.P.: Decision support for consumer direct grocery initiatives. Transp. Sci. 39(3), 313–327 (2005). https://doi.org/10.1287/trsc.1040.0105
Cleophas, C., Ehmke, J.: When are deliveries profitable? Bus. Inf. Syst. Eng. 6, 153–163 (2014)
Ehmke, J.F., Campbell, A.M.: Customer acceptance mechanisms for home deliveries in metropolitan areas. Eur. J. Oper. Res. 233(1), 193–207 (2014). https://doi.org/10.1016/j.ejor.2013.08.028
Klein, R., Mackert, J., Neugebauer, M., Steinhardt, C.: A model-based approximation of opportunity cost for dynamic pricing in attended home delivery. OR Spectr. 40(4), 969–996 (2017). https://doi.org/10.1007/s00291-017-0501-3
Klein, R., Neugebauer, M., Ratkovitch, D., Steinhardt, C.: Differentiated time slot pricing under routing considerations in attended home delivery. Transp. Sci. 53(1), 236–255 (2019). https://doi.org/10.1287/trsc.2017.0738
Lee, T.C., Hersh, M.: A model for dynamic airline seat inventory control with multiple seat bookings. Transp. Sci. 27(3), 252–265 (1993)
Nicola, D., Vetschera, R., Dragomir, A.: Total distance approximations for routing solutions. Comput. Oper. Res. 102, 67–74 (2019)
ORTEC: Vehicle routing solutions. https://ortec.com/en/solutions/vehicle-routing. Accessed 14 July 2022
Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825–2830 (2011)
Robuste, F., Daganzo, C.F., Souleyrette, R.R.: Implementing vehicle routing models. Transp. Res. Part B Methodol. 24(4), 263–286 (1990)
Snoeck, A., Merchán, D., Winkenbach, M.: Revenue management in last-mile delivery: state-of-the-art and future research directions. Transp. Res. Procedia 46, 109–116 (2020). https://doi.org/10.1016/j.trpro.2020.03.170. The 11th International Conference on City Logistics, Dubrovnik, Croatia, 12–14 June 2019
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254–265 (1987). https://doi.org/10.1287/opre.35.2.254
Strauss, A.K., Klein, R., Steinhardt, C.: A review of choice-based revenue management: theory and methods. Eur. J. Oper. Res. 271(2), 375–387 (2018). https://doi.org/10.1016/j.ejor.2018.01.011
Visser, T., Agatz, N., Spliet, R.: Simultaneous customer interaction in online booking systems for attended home delivery. Technical report, ERS-2019-011-LIS, ERIM Report Series Research in Management, Erasmus Research Institute of Management, October 2019. http://hdl.handle.net/1765/120585
Yang, X., Strauss, A.: An approximate dynamic programming approach to attended home delivery management. Eur. J. Oper. Res. 263, 935–945 (2017). https://doi.org/10.1016/j.ejor.2017.06.034
Yang, X., Strauss, A.K., Currie, C.S.M., Eglese, R.: Choice-based demand management and vehicle routing in e-fulfillment. Transp. Sci. 50(2), 473–488 (2016). https://doi.org/10.1287/trsc.2014.0549
Yrjölä, H.: Physical distribution considerations for electronic grocery shopping. Int. J. Phys. Distrib. Logist. Manag. 31(10), 746–761 (2001)
Acknowledgements
This paper is based on the master thesis of Fabian Akkerman supervised by Martijn Mes and Eduardo Lalla-Ruiz. We would like to thank Thomas Visser of ORTEC for his advice and assistance during the graduation process.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Akkerman, F., Mes, M., Lalla-Ruiz, E. (2022). Dynamic Time Slot Pricing Using Delivery Costs Approximations. In: de Armas, J., Ramalhinho, H., Voß, S. (eds) Computational Logistics. ICCL 2022. Lecture Notes in Computer Science, vol 13557. Springer, Cham. https://doi.org/10.1007/978-3-031-16579-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-031-16579-5_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-16578-8
Online ISBN: 978-3-031-16579-5
eBook Packages: Computer ScienceComputer Science (R0)