Machine Learning-Empowered Benders Decomposition for Flow Hub Location in E-Commerce

References

• Alpaydin E (2020) Introduction to Machine Learning (MIT Press, Cambridge, MA).Google 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–17.Crossref, Google Scholar
• Armaghan A, Contreras I, Fernández E (2018) Exact solution of hub network design problems with profits. Eur. J. Oper. Res. 266:57–71.Crossref, Google Scholar
• Birge JR, Louveaux FV (1988) A multicut algorithm for two-stage stochastic linear programs. Eur. J. Oper. Res. 34:384–392.Crossref, Google Scholar
• Blanco V, Fernández E, Hinojosa Y (2023) Hub location with protection under interhub link failures. INFORMS J. Comput. 35(5):966–985.Link, Google Scholar
• Bütün C, Petrovic S, Muyldermans L (2021) The capacitated directed cycle hub location and routing problem under congestion. Eur. J. Oper. Res. 292:714–734.Crossref, Google Scholar
• Campbell JF (1994) Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72:387–405.Crossref, Google Scholar
• Contreras I, Fernández E (2014) Hub location as the minimization of a supermodular set function. Oper. Res. 62:557–570.Link, Google Scholar
• Contreras I, Cordeau J-F, Laporte G (2011a) Benders decomposition for large-scale uncapacitated hub location. Oper. Res. 59(6):1477–1490.Link, Google Scholar
• Contreras I, Cordeau J-F, Laporte G (2012) Exact solution of large-scale hub location problems with multiple capacity levels. Transportation Sci. 46:439–459.Link, Google Scholar
• Contreras I, Díaz JA, Fernández E (2011b) Branch and price for large-scale capacitated hub location problems with single assignment. INFORMS J. Comput. 23(1):41–55.Link, Google Scholar
• Contreras I, Tanash M, Vidyarthi N (2017) Exact and heuristic approaches for the cycle hub location problem. Ann. Oper. Res. 258:655–677.Crossref, Google Scholar
• Cordeau J-F, Soumis F, Desrosiers J (2001) Simultaneous assignment of locomotives and cars to passenger trains. Oper. Res. 49:531–548.Link, Google Scholar
• de Camargo RS, Miranda G, Luna HP (2008) Benders decomposition for the uncapacitated multiple allocation hub location problem. Comput. Oper. Res. 35:1047–1064.Crossref, Google Scholar
• Elhedhli S, Wu H (2010) A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion. INFORMS J. Comput. 22:282–296.Link, Google Scholar
• Ernst AT, Krishnamoorthy M (1996) Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Sci. 4:139–154.Crossref, Google Scholar
• Ernst AT, Krishnamoorthy M (1998) An exact solution approach based on shortest-paths for p-hub median problems. INFORMS J. Comput. 10:149–162.Link, Google Scholar
• Farahani RZ, Hekmatfar M, Arabani AB, Nikbakhsh E (2013) Hub location problems: A review of models, classification, solution techniques, and applications. Comput. Indust. Engrg. 64:1096–1109.Crossref, Google Scholar
• Gelareh S, Monemi RN, Nickel S (2015) Multi-period hub location problems in transportation. Transportation Res. Part E Logist. Transportation Rev. 75:67–94.Crossref, Google Scholar
• Gelareh S, Nickel S, Pisinger D (2010) Liner shipping hub network design in a competitive environment. Transportation Res. Part E Logist. Transportation Rev. 46:991–1004.Crossref, Google Scholar
• Ghaffarinasab N, Motallebzadeh A, Jabarzadeh Y, Kara BY (2018) Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems. Comput. Oper. Res. 90:173–192.Crossref, Google Scholar
• Guan J, Lin G, Feng H-B (2018) A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem. Comput. Oper. Res. 98:1–12.Crossref, Google Scholar
• Hamacher HW, Labbé M, Nickel M, Sonneborn T (2004) Adapting polyhedral properties from facility to hub location problems. Discrete Appl. Math. 145:104–116.Crossref, Google Scholar
• He Y, Wu T, Zhang C, Liang Z (2015) An improved MIP heuristic for the intermodal hub location problem. Omega 57:203–211.Crossref, Google Scholar
• Hosmer DW Jr, Lemeshow S, Sturdivant RX (2013) Applied Logistic Regression (John Wiley & Sons, Hoboken, NJ).Crossref, Google Scholar
• Klincewicz JG (2002) Enumeration and search procedures for a hub location problem with economies of scale. Ann. Oper. Res. 110:107–122. Crossref, Google Scholar
• Larsen E, Frejinger E, Gendron B, Lodi A (2024) Fast continuous and integer L-shaped heuristics through supervised learning. INFORMS J. Comput. 36(1):203–223.Link, Google Scholar
• Liu J, Chen W, Yang J, Xiong H, Chen C (2022) Iterative prediction-and-optimization for e-logistics distribution network design. INFORMS J. Comput. 34:769–789.Link, Google Scholar
• Mayer G, Wagner B (2002) HubLocator: An exact solution method for the multiple allocation hub location problem. Comput. Oper. Res. 29:715–739.Crossref, Google Scholar
• Meng Q, Wang X (2011) Intermodal hub-and-spoke network design: Incorporating multiple stakeholders and multi-type containers. Transportation Res. Part B Methodological 45:724–742.Crossref, Google Scholar
• Mohammadi M, Jula P, Tovakkoli-Moghaddam R (2019) Reliable single-allocation hub location problem with disruptions. Transportation Res. Part E Logist. Transportation Rev. 123:90–120.Crossref, Google Scholar
• Najy W, Diabat A (2020) Benders decomposition for multiple-allocation hub-and-spoke network design with economies of scale and node congestion. Transportation Res. Part B Methodological 133:62–84.Crossref, Google Scholar
• O’Kelly ME (1987) A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32:393–404.Crossref, Google Scholar
• O’Kelly ME, Bryan DL (1998) Hub location with flow economies of scale. Transportation Res. Part B Methodological 32:605–616.Crossref, Google Scholar
• Rahmaniani R, Crainic TG, Gendreau M, Rei W (2017) The Benders decomposition algorithm: A literature review. Eur. J. Oper. Res. 259:801–817.Crossref, Google Scholar
• Rahmaniani R, Crainic TG, Gendreau M, Rei W (2018) Accelerating the Benders decomposition method: Application to stochastic network design problems. SIAM J. Optim. 28:875–903.Crossref, Google Scholar
• Taherkhani G, Alumur SA, Hosseini M (2020) Benders decomposition for the profit maximizing capacitated hub location problem with multiple demand classes. Transportation Sci. 54:1446–1470.Link, Google Scholar
• Wu T, Shi Z, Zhang C (2021) The hub location problem with market selection. Comput. Oper. Res. 127:105136.Crossref, Google Scholar
• Wu T, Chen W, Cordeau J-F, Jans R (2025) Machine learning-empowered Benders decomposition for flow hub location in e-commerce. http://dx.doi.org/10.1287/ijoc.2023.0367.cd, https://github.com/INFORMSJoC/2023.0367.Google Scholar
• Wu T, Huang L, Liang Z, Zhang X, Zhang C (2022a) A supervised learning-driven heuristic for solving the facility location and production planning problem. Eur. J. Oper. Res. 301(2):785–796.Crossref, Google Scholar
• Wu T, Zhang C, Chen W, Liang Z, Zhang X (2022b) Unsupervised learning-driven matheuristic for production-distribution problems. Transportation Sci. 56(6):1677–1702.Link, Google Scholar
• Zhao Y, Chen Z, Zhang Z (2023) Distributionally robust chance-constrained p-hub center problem. INFORMS J. Comput. 35(6):1361–1382.Link, Google Scholar