Service Network Design for Same-Day Delivery with Hub Capacity Constraints

Published Online:https://doi.org/10.1287/trsc.2022.1155

References

  • Alnaggar A, Gzara F, Bookbinder JH (2019) Crowdsourced delivery: A review of platforms and academic literature. Omega 98:102139.CrossrefGoogle Scholar
  • Alumur SA, Campbell JF, Contreras I, Kara BY, Marianov V, O’Kelly ME (2021) Perspectives on modeling hub location problems. Eur. J. Oper. Res. 291(1):1–17.CrossrefGoogle Scholar
  • Barnhart C, Jin H, Vance PH (2000) Railroad blocking: A network design application. Oper. Res. 48(4):603–614.LinkGoogle Scholar
  • Barnhart C, Krishnan N, Kim D, Ware K (2002) Network design for express shipment delivery. Comput. Optim. Appl. 21(3):239–262.CrossrefGoogle Scholar
  • Belieres S, Hewitt M, Jozefowiez N, Semet F (2021) A time-expanded network reduction matheuristic for the logistics service network design problem. Transportation Res. Part E Logist. Transportation Rev. 147:102203.CrossrefGoogle Scholar
  • Berbeglia G, Cordeau JF, Laporte G (2010) Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202(1):8–15.CrossrefGoogle Scholar
  • Boland N, Hewitt M, Marshall L, Savelsbergh M (2017) The continuous-time service network design problem. Oper. Res. 65(5):1303–1321.LinkGoogle Scholar
  • Bouros P, Sacharidis D, Dalamagas T, Sellis T (2011) Dynamic pickup and delivery with transfers. Pfoser D, Tao Y, Mouratidis K, Nascimento MA, Mokbel M, Shekhar S, Huang Y, eds. Advances in Spatial and Temporal Databases (Springer, Berlin), 112–129.CrossrefGoogle Scholar
  • Brouer BD, Desaulniers G, Pisinger D (2014) A matheuristic for the liner shipping network design problem. Transportation Res. Part E Logist. Transportation Rev. 72:42–59.CrossrefGoogle Scholar
  • Clautiaux F, Hanafi S, Macedo R, Voge MÉ, Alves C (2017) Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints. Eur. J. Oper. Res. 258(2):467–477.CrossrefGoogle Scholar
  • Crainic TG (2000) Service network design in freight transportation. Eur. J. Oper. Res. 122(2):272–288.CrossrefGoogle Scholar
  • Crainic TG, Hewitt M, Toulouse M, Vu DM (2014) Service network design with resource constraints. Transportation Sci. 50(4):1380–1393.LinkGoogle Scholar
  • Dukkanci O, Kara BY (2017) Routing and scheduling decisions in the hierarchical hub location problem. Comput. Oper. Res. 85:45–57.CrossrefGoogle Scholar
  • Fleischer L, Skutella M (2007) Quickest flows over time. SIAM J. Comput. 36(6):1600–1630.CrossrefGoogle Scholar
  • Frangioni A, Gendron B (2009) 0–1 reformulations of the multicommodity capacitated network design problem. Discrete Appl. Math. 157(6):1229–1241.CrossrefGoogle Scholar
  • Gendron B, Larose M (2014) Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design. EURO J. Comput. Optim. 2(1-2):55–75.CrossrefGoogle Scholar
  • Gendron B, Crainic TG, Frangioni A (1999) Multicommodity capacitated network design. Sansò B, Soriano P, eds. Telecommunications Network Planning (Springer, New York), 1–19.CrossrefGoogle Scholar
  • Gendron B, Hanafi S, Todosijević R (2018) Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design. Eur. J. Oper. Res. 268(1):70–81.CrossrefGoogle Scholar
  • Haghani A, Oh SC (1996) Formulation and solution of a multi-commodity, multi-modal network flow model for disaster relief operations. Transportation Res. Part A Policy Practice 30(3):231–250.CrossrefGoogle Scholar
  • Ho SC, Szeto W, Kuo YH, Leung JM, Petering M, Tou TW (2018) A survey of dial-a-ride problems: Literature review and recent developments. Transportation Res. Part B: Methodological 111:395–421.CrossrefGoogle Scholar
  • Kennington JL, Nicholson CD (2010) The uncapacitated time-space fixed-charge network flow problem: An empirical investigation of procedures for arc capacity assignment. INFORMS J. Comput. 22(2):326–337.LinkGoogle Scholar
  • Kim D, Barnhart C, Ware K, Reinhardt G (1999) Multimodal express package delivery: A service network design application. Transportation Sci. 33(4):391–407.LinkGoogle Scholar
  • Lin B, Zhao Y, Lin R (2020) Optimization for courier delivery service network design based on frequency delay. Comput. Indust. Engrg. 139:106–144.CrossrefGoogle Scholar
  • Lindsey K, Erera A, Savelsbergh M (2016) Improved integer programming-based neighborhood search for less-than-truckload load plan design. Transportation Sci. 50(4):1360–1379.LinkGoogle Scholar
  • Masaeli M, Alumur SA, Bookbinder JH (2018) Shipment scheduling in hub location problems. Transportation Res. Part B Methodological 115:126–142.CrossrefGoogle Scholar
  • Pillac V, Gendreau M, Guéret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1):1–11.CrossrefGoogle Scholar
  • Psaraftis HN, Wen M, Kontovas CA (2016) Dynamic vehicle routing problems: Three decades and counting. Networks 67(1):3–31.CrossrefGoogle Scholar
  • Rothenbächer AK, Drexl M, Irnich S (2016) Branch-and-price-and-cut for a service network design and hub location problem. Eur. J. Oper. Res. 255(3):935–947.CrossrefGoogle Scholar
  • Sampaio A, Savelsbergh M, Veelenturf L, Woensel TV (2019) Crowd-based city logistics. Faulin J, Grasman SE, Juan AA, Hirsch P, eds. Sustainable Transportation and Smart Logistics (Elsevier, Amsterdam), 381–400.CrossrefGoogle Scholar
  • Savelsbergh M, Van Woensel T (2016) City logistics: Challenges and opportunities. Transportation Sci. 50(2):579–590.LinkGoogle Scholar
  • Smilowitz KR, Daganzo CF (2007) Continuum approximation techniques for the design of integrated package distribution systems. Networks 50(3):183–196.CrossrefGoogle Scholar
  • Turban E, King D, Lee JK, Liang TP, Turban DC (2015) Electronic Commerce: A Managerial and Social Networks Perspective (Springer, Cham, Switzerland).CrossrefGoogle Scholar
  • Wieberneit N (2008) Service network design for freight transportation: A review. OR Spectrum 30(1):77–112.CrossrefGoogle Scholar
  • Yaman H, Karasan OE, Kara BY (2012) Release time scheduling and hub location for next-day delivery. Oper. Res. 60(4):906–917.LinkGoogle Scholar
  • Yildiz B, Savelsbergh M (2022) Optimizing package express operations in China. Eur. J. Oper. Res. 300(1):320–335.CrossrefGoogle Scholar
  • Zawack DJ, Thompson GL (1987) A dynamic space-time network flow model for city traffic congestion. Transportation Sci. 21(3):153–162.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.