Learning Dynamic Selection and Pricing of Out-of-Home Deliveries

References

• Agatz N, Campbell A, Fleischmann M, Savelsbergh M (2011) Time slot management in attended home delivery. Transportation Sci. 45(3):435–449.Link, Google Scholar
• Akamai (2017) Akamai online retail performance report: Milliseconds are critical. Accessed October 7, 2024, https://www.ir.akamai.com/news-releases/news-release-details/akamai-online-retail-performance-report-milliseconds-are.Google Scholar
• Allied Market Research (2022) CEP market opportunities and forecasts. Accessed October 7, 2024, https://www.alliedmarketresearch.com/courier-express-and-parcel-market-A11516.Google Scholar
• Amazon (2024a) Amazon delivery points. Accessed October 7, 2024, https://www.amazon.com/ulp.Google Scholar
• Amazon (2024b) Amazon hub. Accessed October 7, 2024, https://www.amazon.com/b?ie=UTF8\&node=13853235011.Google Scholar
• Arnold F, Cardenas I, Sörensen K, Dewulf W (2018) Simulation of B2C e-commerce distribution in Antwerp using cargo bikes and delivery points. Eur. Transport Res. Rev. 10:2.Crossref, Google Scholar
• Asdemir K, Jacob VS, Krishnan R (2009) Dynamic pricing of multiple home delivery options. Eur. J. Oper. Res. 196(1):246–257.Crossref, Google Scholar
• Ausseil R, Pazour JA, Ulmer MW (2022) Supplier menus for dynamic matching in peer-to-peer transportation platforms. Transportation Sci. 56(5):1304–1326.Link, Google Scholar
• Campbell A, Savelsbergh M (2006) Incentive schemes for attended home delivery services. Transportation Sci. 40(3):327–341.Link, Google Scholar
• Chen Q, Conway A, Cheng J (2017) Parking for residential delivery in New York City: Regulations and behavior. Transport Policy 54:53–60.Crossref, Google Scholar
• Corless RM, Gonnet GH, Hare DEG, Jeffrey DJ, Knuth DE (1996) On the LambertW function. Adv. Comput. Math. 5(1):329–359.Crossref, Google Scholar
• Dalla Chiara G, Goodchild A (2020) Do commercial vehicles cruise for parking? Empirical evidence from Seattle. Transport Policy 97:26–36.Crossref, Google Scholar
• Dalla Chiara G, Krutein KF, Ranjbari A, Goodchild A (2021) Understanding urban commercial vehicle driver behaviors and decision making. Transportation Res. Rec. 2675(9):608–619.Crossref, Google Scholar
• Deutsch Y, Golany B (2018) A parcel locker network as a solution to the logistics last mile problem. Internat. J. Production Res. 56(1–2):251–261.Crossref, Google Scholar
• Dong L, Kouvelis P, Tian Z (2009) Dynamic pricing and inventory control of substitute products. Manufacturing Service Oper. Management 11(2):317–339.Link, Google Scholar
• Dumez D, Lehuédé F, Péton O (2021) A large neighborhood search approach to the vehicle routing problem with delivery options. Transportation Res. Part B Methodological 144:103–132.Crossref, Google Scholar
• Edwards J, Mckinnon A, Cherrett T, Mcleod F, Song L (2009) The impact of failed home deliveries on carbon emissions: Are collection/delivery points environmentally-friendly alternatives? Logist. Res. Network Annual Conf. (Cardiff, UK).Google Scholar
• Enthoven DLJU, Jargalsaikhan B, Roodbergen KJ, uit het Broek MAJ, Schrotenboer AH (2020) The two-echelon vehicle routing problem with covering options: City logistics with cargo bikes and parcel lockers. Comput. Oper. Res. 118:104919.Crossref, Google Scholar
• Galiullina A, Mutlu N, Kinable J, Van Woensel T (2024) Demand steering in a last-mile delivery problem with home and pickup point delivery options. Transportation Sci. 58(2):454–473.Link, Google Scholar
• Gehring H, Homberger J (2002) Parallelization of a two-phase metaheuristic for routing problems with time windows. J. Heuristics 8(3):251–276.Crossref, Google Scholar
• Ghaderi H, Zhang L, Tsai PW, Woo J (2022) Crowdsourced last-mile delivery with parcel lockers. Internat. J. Production Econom. 251:108549.Crossref, Google Scholar
• Goodfellow I, Bengio Y, Courville A (2016) Deep Learning (MIT Press, Cambridge, MA).Google Scholar
• Grabenschweiger J, Doerner KF, Hartl RF, Savelsbergh MWP (2021) The vehicle routing problem with heterogeneous locker boxes. Central Eur. J. Oper. Res. 29(1):113–142.Crossref, Google Scholar
• Janinhoff L, Klein R (2023) Stochastic location routing for out-of-home delivery networks. Preprint, submitted December 20, https://dx.doi.org/10.2139/ssrn.4654115.Google Scholar
• Janinhoff L, Klein R, Sailer D, Schoppa JM (2024) Out-of-home delivery in last-mile logistics: A review. Comput. Oper. Res. 168:106686.Google Scholar
• Jiang L, Dhiaf M, Dong J, Liang C, Zhao S (2020) A traveling salesman problem with time windows for the last mile delivery in online shopping. Internat. J. Production Res. 58(16):5077–5088.Crossref, Google Scholar
• Kahr M (2022) Determining locations and layouts for parcel lockers to support supply chain viability at the last mile. Omega 113:102721.Crossref, Google Scholar
• Karabulut E, Gholizadeh F, Akhavan-Tabatabaei R (2022) The value of adaptive menu sizes in peer-to-peer platforms. Transportation Res. Part C Emerging Tech. 145:103948.Crossref, Google Scholar
• Kedia A, Kusumastuti D, Nicholson A (2017) Acceptability of collection and delivery points from consumers’ perspective: A qualitative case study of Christchurch City. Case Studies Transport Policy 5(4):587–595.Crossref, Google Scholar
• Kingma D, Ba J (2014) Adam: A method for stochastic optimization. Preprint, submitted December 22, https://arxiv.org/abs/1412.6980.Google Scholar
• Klein R, Mackert J, Neugebauer M, Steinhardt C (2018) A model-based approximation of opportunity cost for dynamic pricing in attended home delivery. OR Spectrum 40(4):969–996.Crossref, Google Scholar
• Klein R, Neugebauer M, Ratkovitch D, Steinhardt C (2019) Differentiated time slot pricing under routing considerations in attended home delivery. Transportation Sci. 53(1):236–255.Link, Google Scholar
• Koch S, Klein R (2020) Route-based approximate dynamic programming for dynamic pricing in attended home delivery. Eur. J. Oper. Res. 287(2):633–652.Crossref, Google Scholar
• Konidaris G, Osentoski S, Thomas P (2011) Value function approximation in reinforcement learning using the Fourier basis. Proc. Conf. AAAI Artificial Intelligence, vol. 25 (AAAI Press, Palo Alto, CA), 380–385.Google Scholar
• Last Mile Experts (2022) Out of home delivery in Europe. Accessed October 7, 2024, https://lastmileexperts.com/reports-case-studies/.Google Scholar
• Li Z, Liu F, Yang W, Peng S, Zhou J (2022) A survey of convolutional neural networks: Analysis, applications, and prospects. IEEE Trans. Neural Networks Learn. Systems 33(12): 6999–7019.Crossref, Google Scholar
• Lin Y, Wang Y, Lee LH, Chew EP (2022) Profit-maximizing parcel locker location problem under threshold luce model. Transportation Res. Part E Logist. Transportation Rev. 157:102541.Crossref, Google Scholar
• Liu Y, Ye Q, Escribano-Macias J, Feng Y, Candela E, Angeloudis P (2023) Route planning for last-mile deliveries using mobile parcel lockers: A hybrid q-learning network approach. Transportation Res. Part E Logist. Transportation Rev. 177:103234.Crossref, Google Scholar
• Loquate (2021) Fixing failed deliveries. Accessed October 7, 2024, https://www.loqate.com/resources/ebooks-and-reports/fixing-failed-deliveries/.Google Scholar
• Luo R, Ji S, Ji Y (2022) An active-learning Pareto evolutionary algorithm for parcel locker network design considering accessibility of customers. Comput. Oper. Res. 141:105677.Crossref, Google Scholar
• Lyu G, Teo CP (2022) Last mile innovation: The case of the locker alliance network. Manufacturing Service Oper. Management 24(5):2425–2443.Link, Google Scholar
• Mancini S, Gansterer M (2021) Vehicle routing with private and shared delivery locations. Comput. Oper. Res. 133:105361.Crossref, Google Scholar
• Mancini S, Gansterer M, Triki C (2023) Locker box location planning under uncertainty in demand and capacity availability. Omega 120:102910.Crossref, Google Scholar
• Merchan D, Arora J, Pachon J, Konduri K, Winkenbach M, Parks S, Noszek J (2022) 2021 Amazon last mile routing research challenge: Data set. Transportation Sci. 58(1):8–11.Link, Google Scholar
• Mnih V, Kavukcuoglu K, Silver D, Graves A, Antonoglou I, Wierstra D, Riedmiller M (2013) Playing Atari with deep reinforcement learning. Preprint, submitted December 19, https://arxiv.org/abs/1312.5602.Google Scholar
• Molga M, Smutnicki C (2005) Test functions for optimization needs. Accessed October 7, 2024, https://www.sfu.ca/∼ssurjano/camel6.html.Google Scholar
• Pan S, Zhang L, Thompson RG, Ghaderi H (2021) A parcel network flow approach for joint delivery networks using parcel lockers. Internat. J. Production Res. 59(7):2090–2115.Crossref, Google Scholar
• Paszke A, Gross S, Massa F, Lerer A, Bradbury J, Chanan G, Killeen T, et al. (2019) Pytorch: An imperative style, high-performance deep learning library. Wallach H, Larochelle H, Beygelzimer A, d’Alché-Buc F, Fox E, Garnett R, eds. Adv. Neural Inform. Processing Systems, vol. 32 (Curran Associates, Inc., Red Hook, NY), 8024–8035.Google Scholar
• Peng X, Zhang L, Thompson RG, Wang K (2023) A three-phase heuristic for last-mile delivery with spatial-temporal consolidation and delivery options. Internat. J. Production Econom. 266:109044.Crossref, Google Scholar
• Ranjbari A, Diehl C, Dalla Chiara G, Goodchild A (2023) Do parcel lockers reduce delivery times? Evidence from the field. Transportation Res. Part E Logist. Transportation Rev. 172:103070.Crossref, Google Scholar
• Raviv T (2023) The service points’ location and capacity problem. Transportation Res. Part E Logist. Transportation Rev. 176:103216.Crossref, Google Scholar
• Redlands ESRI (2024) Arcgis desktop: Release 10.8.Google Scholar
• Savelsbergh M, Van Woensel T (2016) 50th anniversary invited article—City logistics: Challenges and opportunities. Transportation Sci. 50(2):579–590.Link, Google Scholar
• Schulman J, Wolski F, Dhariwal P, Radford A, Klimov O (2017) Proximal policy optimization algorithms. Preprint, submitted July 20, https://arxiv.org/abs/1707.06347.Google Scholar
• Schwerdfeger S, Boysen N (2022) Who moves the locker? A benchmark study of alternative mobile parcel locker concepts. Transportation Res. Part C Emerging Tech. 142:103780.Crossref, Google Scholar
• Sethuraman S, Bansal A, Mardan S, Resende MGC, Jacobs TL (2024) Amazon locker capacity management. INFORMS J. Appl. Anal. Forthcoming.Google Scholar
• Silver D, Lever G, Heess N, Degris T, Wierstra D, Riedmiller M (2014) Deterministic policy gradient algorithms. Xing EP, Jebara T, eds. Proc. 31st Internat. Conf. Machine Learn., vol. 32 (PLMR, New York), 387–395.Google Scholar
• Sitek P, Wikarek J (2019) Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): Model and implementation using hybrid approach. Ann. Oper. Res. 273(1):257–277.Crossref, Google Scholar
• Song L, Cherrett T, McLeod F, Guan W (2009) Addressing the last mile problem: Transport impacts of collection and delivery points. Transportation Res. Rec. 2097(1):9–18.Crossref, Google Scholar
• Strauss A, Gülpinar N, Zheng Y (2021) Dynamic pricing of flexible time slots for attended home delivery. Eur. J. Oper. Res. 294(3):1022–1041.Crossref, Google Scholar
• Train KE (2009) Discrete Choice Methods with Simulation, 2nd ed. (Cambridge Books, Cambridge University Press, New York).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, Streng S (2019) Same-day delivery with pickup stations and autonomous vehicles. Comput. Oper. Res. 108:1–19.Crossref, Google Scholar
• Vidal T (2022) Hybrid genetic search for the CVRP: Open-source implementation and SWAP* neighborhood. Comput. Oper. Res. 140:105643.Crossref, Google Scholar
• Vidal T, Crainic TG, Gendreau M, Lahrichi N, Rei W (2012) A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3):611–624.Link, Google Scholar
• Vinsensius A, Wang Y, Chew EP, Lee LH (2020) Dynamic incentive mechanism for delivery slot management in e-commerce attended home delivery. Transportation Sci. 54(3):567–587.Link, Google Scholar
• Vukićević M, Ratli M, Rivenq A, Zrikem M (2023) Covering delivery problem with electric vehicle and parcel lockers: Variable neighborhood search approach. Comput. Oper. Res. 157:106263.Crossref, Google Scholar
• Xu X, Shen Y, Chen W(A), Gong Y, Wang H, (2021) Data-driven decision and analytics of collection and delivery point location problems for online retailers. Omega 100:102280.Crossref, Google Scholar
• Yang X, Strauss AK (2017) An approximate dynamic programming approach to attended home delivery management. Eur. J. Oper. Res. 263(3):935–945.Crossref, Google Scholar
• Yang X, Strauss AK, Currie CSM, Eglese R (2016) Choice-based demand management and vehicle routing in e-fulfillment. Transportation Sci. 50(2):473–488.Link, Google Scholar
• Yildiz B, Savelsbergh M (2020) Pricing for delivery time flexibility. Transportation Res. Part B Methodological 133:230–256.Crossref, Google Scholar
• Zhang W, Xu M, Wang S (2023) Joint location and pricing optimization of self-service in urban logistics considering customers’ choice behavior. Transportation Res. Part E Logist. Transportation Rev. 174:103128.Crossref, Google Scholar
• Zhou L, Baldacci R, Vigo D, Wang X (2018) A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution. Eur. J. Oper. Res. 265(2):765–778.Crossref, Google Scholar