Fleet Sizing and Service Region Partitioning for Same-Day Delivery Systems

References

• Adobe Analytics (2020) Adobe digital economy index. Accessed December 1, 2020, https://www.adobe.com/content/dam/dx/us/en/experience-cloud/digital-insights/pdfs/adobe_analytics-digital-economy-index-2020.pdf.Google Scholar
• Amazon (2018) Amazon expands free shipping to everyone for the holiday season. Accessed December 1, 2020, https://press.aboutamazon.com/news-releases/news-release-details/amazon-expands-free-shipping-everyone-holiday-season.Google Scholar
• 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: Methodology 107:229–252.Crossref, Google Scholar
• Applegate D, Bixby R, Chvátal V, Cook W (2007) The Traveling Salesman Problem: A Computational Study (Princeton University Press, Princeton, NJ).Google Scholar
• Beardwood J, Halton J, Hammersley J (1959) The shortest path through many points. Math. Proc. Cambridge Philosophical Soc. 55(4):299–327.Crossref, Google Scholar
• Bergmann F, Wagner S, Winkenbach M (2020) Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution. Transportation Res., Part B: Methodology 131:26–62.Crossref, Google Scholar
• Bolgert S (2019) tripy 1.0.0. Accessed May 10, 2020, https://pypi.org/project/tripy/.Google Scholar
• Bramel J, Simchi-Levi D (1995) A location based heuristic for general routing problems. Oper. Res. 43(4):649–660.Link, Google Scholar
• Brent R (1973) Algorithms for Minimization Without Derivatives (Prentice-Hall, Upper Saddle River, NJ).Google Scholar
• Carlsson J (2012) Dividing a territory among several vehicles. INFORMS J. Comput. 24(4):565–577.Link, Google Scholar
• Carlsson J, Delage E (2013) Robust partitioning for stochastic multivehicle routing. Oper. Res. 61(3):727–744.Link, Google Scholar
• Carlsson J, Jia F (2013) Euclidean hub-and-spoke networks. Oper. Res. 61(6):1360–1382.Link, Google Scholar
• Carlsson J, Liu S, Salari N, Yu H (2021) Provably good region partitioning for on-time last-mile delivery. Preprint, submitted September 3, accessed January 4, 2022, https://dx.doi.org/10.2139/ssrn.3915544.Google Scholar
• Carlsson J, Song S (2018) Coordinated logistics with a truck and a drone. Management Sci. 64(9):4052–4069.Link, Google Scholar
• Cattaruzza D, Absi N, Feillet D (2016a) The multi-trip vehicle routing problem with time windows and release dates. Transportation Sci. 50(2):676–693.Link, Google Scholar
• Cattaruzza D, Absi N, Feillet D (2016b) Vehicle routing problems with multiple trips. 4OR 14:223–259.Crossref, Google Scholar
• Chen X, Ulmer M, Thomas B (2022) Deep Q-learning for same-day delivery with vehicles and drones. Eur. J. Oper. Res. 298(3):939–952.Crossref, Google Scholar
• Chen X, Wang T, Ulmer M, Thomas B (2021) Same-day delivery with fairness. Preprint, submitted July 19, 2020, updated on December 23, 2021, accessed January 4, 2022, https://arxiv.org/abs/2007.09541.Google Scholar
• Côté JF, de Queiroz TA, Gallesi F, Iori M (2019) Optimization methods for the same-day delivery problem. Paolucci M, Sciomachen A, Uberti P, eds. Advances in Optimization and Decision Science for Society, Services and Enterprises (Springer, Berlin), 335–349.Crossref, Google Scholar
• Daganzo C (1984) The length of tours in zones of different shapes. Transportation Res., Part B: Methodology 188(2):135–145.Crossref, Google Scholar
• Daganzo C (2005) Logistics Systems Analysis, 4th ed. (Springer, Berlin).Google Scholar
• Dayarian I, Savelsbergh M, Clarke JP (2020) Same-day delivery with drone resupply. Transportation Sci. 54(1):229–249.Link, Google Scholar
• Du Q, Faber V, Gunzburger M (1999) Centroidal Voronoi tessellations: Applications and algorithms. SIAM Rev. 41(4):637–676.Crossref, Google Scholar
• Erera A (2000) Design of large-scale logistics systems for uncertain environments. PhD thesis, University of California, Berkeley.Google Scholar
• Franceschetti A, Jabali O, Laporte G (2017a) Continuous approximation models in freight distribution management. TOP 25(3):413–433.Crossref, Google Scholar
• Franceschetti A, Honhon D, Laporte G, van Woensel T, Fransoo J (2017b) Strategic fleet planning for city logistics. Transportation Res., Part B: Methodology 95:19–40.Crossref, Google Scholar
• Galvão L, Novaes A, Souza De Cursi J, Souza J (2006) A multiplicatively-weighted Voronoi diagram approach to logistics districting. Comput. Oper. Res. 33(1):93–114.Crossref, Google Scholar
• Heidelberg Institute for Geoinformation Technology (2021) Openrouteservice. Accessed June 8, 2021, https://openrouteservice.org/.Google Scholar
• Johnson D, McGeoch L, Rothberg E (1996) Asymptotic experimental analysis for the Held-Karp traveling salesman bound. Proc. 7th Annual ACM-SIAM Sympos. on Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 341–350.Google Scholar
• Klapp M, Erera A, Toriello A (2018a) The dynamic dispatch waves problem for same-day delivery. Eur. J. Oper. Res. 271(2):519–534.Crossref, Google Scholar
• Klapp M, Erera A, Toriello A (2018b) The one-dimensional dynamic dispatch waves problem. Transportation Sci. 52(2):402–415.Link, Google Scholar
• Klapp M, Erera A, Toriello A (2020) Request acceptance in same-day delivery. Transportation Res., Part E Logist. Transportation Rev. 143:102083.Crossref, Google Scholar
• Lei H, Laporte G, Guo B (2012) Districting for routing with stochastic customers. Eur. J. Transportation Logist. 1(1–2):67–85.Crossref, Google Scholar
• Merchán D, Winkenbach M (2019) An empirical validation and data-driven extension of continuum approximation approaches for urban route distances. Networks 73(4):418–433.Crossref, Google Scholar
• Newell G, Daganzo C (1986a) Design of multiple-vehicle delivery tours: I: A ring-radial network. Transportation Res., Part B: Methodology 20B(5):345–363.Crossref, Google Scholar
• Newell G, Daganzo C (1986b) Design of multiple vehicle delivery tours: II: Other metrics. Transportation Res., Part B: Methodology 20B(5):365–376.Crossref, Google Scholar
• Okabe A, Boots B, Sugihara K, Chiu SN (2000) Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, 2nd ed. (Wiley, New York).Crossref, Google Scholar
• Ouyang Y (2007) Design of vehicle routing zones for large-scale distribution systems. Transportation Res., Part B: Methodology 41(10):1079–1093.Crossref, Google Scholar
• Ouyang Y, Daganzo C (2006) Discretization and validation of the continuum approximation scheme for terminal system design. Transportation Sci. 40(1):89–98.Link, Google Scholar
• Oyola J, Arntzen H, Woodruff D (2017) The stochastic vehicle routing problem, a literature review, part II: Solution methods. Eur. J. Transportation Logist. 6:349–388.Crossref, Google Scholar
• Oyola J, Arntzen H, Woodruff D (2018) The stochastic vehicle routing problem, a literature review, part I: Models. Eur. J. Transportation Logist. 7:193–221.Crossref, Google Scholar
• Paradiso R, Roberti R, Laganá D, Dullaert W (2020) An exact solution framework for multitrip vehicle-routing problems with time windows. Oper. Res. 68(1):180–198.Link, Google Scholar
• Peng L, Murray C (2020) VeRoViz: A vehicle routing visualization toolkit. Preprint, submitted December 30, Accessed June 14, 2021, https://dx.doi.org/10.2139/ssrn.3746037.Google Scholar
• Pillac V, Gendreau M, Guéret C, Medaglia A (2013) A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225:1–11.Crossref, Google Scholar
• Psaraftis H, Wen M, Kontovas C (2016) Dynamic vehicle routing problems: Three decades and counting. Networks 67(1):3–31.Crossref, Google Scholar
• Reyes D, Erera A, Savelsbergh M (2018) Complexity of routing problems with release dates and deadlines. Eur. J. Oper. Res. 266(1):29–34.Crossref, Google Scholar
• Rossiter K (2011) What are census blocks? Accessed July 25, 2021, https://www.census.gov/newsroom/blogs/random-samplings/2011/07/what-are-census-blocks.html.Google Scholar
• Savelsbergh M, Sol M (1995) The general pickup and delivery problem. Transportation Sci. 29(1):17–29.Link, Google Scholar
• Schlömer N (2020) quadpy 0.14.11. Accessed May 10, 2020, https://pypi.org/project/quadpy/.Google Scholar
• SciPy (2019) Optimization and root finding (scipy.optimize). Accessed February 1, 2020, https://docs.scipy.org/doc/scipy/reference/optimize.html.Google Scholar
• Stroh A, Erera A, Toriello A (2021) Tactical design of same-day delivery systems. Management Sci., ePub ahead of print September 14, Accessed January 4, 2022, https://doi.org/10.1287/mnsc.2021.4041.Google Scholar
• Thomas L (2019) Target expands same-day shipping option in the latest move in the delivery wars with Walmart and Amazon. Accessed December 1, 2020, https://www.cnbc.com/2019/06/12/target-expands-same-day-delivery-option-in-battle-with-walmart-amazon.html.Google Scholar
• Ulmer M (2017) Delivery deadlines in same-day delivery. Logist. Res. 10(1):1–15.Google Scholar
• Ulmer M, Streng S (2019) Same-day delivery with pickup stations and autonomous vehicles. Comput. Oper. Res. 108:1–19.Crossref, Google Scholar
• Ulmer M, Thomas B (2018) Same-day delivery with heterogeneous fleets of drones and vehicles. Networks 72(4):475–505.Crossref, Google Scholar
• Ulmer M, Mattfeld D, Köster F (2018) Budgeting time for dynamic vehicle routing with stochastic customer requests. Transportation Sci. 52(1):20–37.Link, Google Scholar
• Ulmer M, Thomas B, Mattfeld D (2019a) Preemptive depot returns for dynamic same-day delivery. Euro. J. Transportation. Logist. 8(4):327–361.Crossref, Google Scholar
• Ulmer M, Goodson J, Mattfeld D, Hennig M (2019b) Offline-online approximate dynamic programming for dynamic vehicle routing with stochastic requests. Transportation Sci. 53(1):185–202.Link, Google Scholar
• United States Census Bureau (2020) Quarterly retail e-commerce sales 1st quarter 2020. Accessed December 1, 2020, https://www2.census.gov/retail/releases/historical/ecomm/20q1.pdf.Google Scholar
• van Heeswijk W, Mes M, Schutten M (2019) The delivery dispatching problem with time windows for urban consolidation centers. Transportation Sci. 53(1):203–221.Link, Google Scholar
• Voccia S, Campbell A, Thomas B (2019) The same-day delivery problem for online purchases. Transportation Sci. 53(1):167–184.Link, Google Scholar
• Xiao H, Gimbutas Z (2010) A numerical algorithm for the construction of efficient quadrature rules in two and higher dimensions. Comput. Math. Appl. 59(2):663–676.Crossref, Google Scholar
• Yao B, McLean C, Yang H (2019) Robust optimization of dynamic route planning in same-day delivery networks with one-time observation of new demand. Networks 73(4):434–452.Crossref, Google Scholar
• Zhong H, Hall R, Dessouky M (2007) Territory planning and vehicle dispatching with driver learning. Transportation Sci. 41(1):74–89.Link, Google Scholar