Hub Network Design Problem with Capacity, Congestion, and Stochastic Demand Considerations

References

• Ahuja RK, Magnanti TL, Orlin JB (1988) Network Flows (Alfred P. Sloan School of Management, Cambridge, MA).Crossref, Google Scholar
• Alibeyg A, Contreras I, Fernández E (2016) Hub network design problems with profits. Transportation Res., Part E Logist. Transportation Rev. 96:40–59.Crossref, Google Scholar
• Alizadeh F, Goldfarb D (2003) Second-order cone programming. Math. Programming 95(1):3–51.Crossref, Google Scholar
• Alumur SA, Kara BY (2008) Network hub location problems: The state of the art. Eur. J. Oper. Res. 190(1):1–21.Crossref, Google Scholar
• Alumur SA, Kara BY, Karasan OE (2009) The design of single allocation incomplete hub networks. Transportation Res. Part B: Methodological 43(10):936–951.Crossref, Google Scholar
• Alumur SA, Nickel S, Saldanha-da Gama F (2012) Hub location under uncertainty. Transportation Res. Part B: Methodological 46(4):529–543.Crossref, Google Scholar
• Alumur SA, Nickel S, Rohrbeck B, da Gama FS (2018) Modeling congestion and service time in hub location problems. Appl. Math. Modeling 55:13–32.Crossref, Google Scholar
• Alumur SA, Campbell JF, Contreras I, Kara BY, Marianov V, O’Kelly ME (2020) Perspectives on modeling hub location problems. Eur. J. Oper. Res. 291(1):1–17.Google Scholar
• Atamtürk A, Berenguer G, Shen ZJ (2012) A conic integer programming approach to stochastic joint location-inventory problems. Oper. Res. 60(2):366–381.Link, Google Scholar
• Aykin T (1994) Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem. Eur. J. Oper. Res. 79(3):50–523.Crossref, Google Scholar
• Azizi N, Vidyarthi N, Chauhan SS (2018) Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion. Ann. Oper. Res. 264(1):1–40.Crossref, Google Scholar
• Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3):316–329.Link, Google Scholar
• Bayram V, Yaman H (2018) Shelter location and evacuation route assignment under uncertainty: A benders decomposition approach. Transportation Sci. 52(2):416–436.Link, Google Scholar
• Beasley JE (2018) OR-library: Hub location. Accessed July 20, 2022, http://people.brunel.ac.uk/mastjjb/jeb/orlib/phubinfo.html.Google Scholar
• Ben-Tal A, Nemirovski A (2001) Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications (MPS-SIAM).Crossref, Google Scholar
• Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerical Math. 4(1):238–252.Crossref, Google Scholar
• Brimberg J, Mladenović N, Todosijević R, Urošević D (2020) A non-triangular hub location problem. Optim. Lett. 14(5):1107–1126.Crossref, 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(2):714–734.Crossref, Google Scholar
• Campbell JF (1992) Location and allocation for distribution systems with transshipments and transportion economies of scale. Ann. Oper. Res. 40(1):77–99.Crossref, Google Scholar
• Campbell JF, O’Kelly ME (2012) Twenty-five years of hub location research. Transportation Sci. 46(2):153–169.Link, Google Scholar
• Campbell JF, Ernst AT, Krishnamoorthy M (2005a) Hub arc location problems: Part i—Introduction and results. Management Sci. 51(10):1540–1555.Link, Google Scholar
• Campbell JF, Ernst AT, Krishnamoorthy M (2005b) Hub arc location problems: Part ii—Formulations and optimal algorithms. Management Sci. 51(10):1556–1571.Link, Google Scholar
• Contreras I (2015) Hub location problems. Laporte G, Nickel S, Saldanha da Gama F, eds. Location Science (Springer International Publishing, Cham, Switzerland), 311–344.Crossref, Google Scholar
• Contreras I, O’Kelly M (2019) Hub location problems. Laporte G, Nickel S, Saldanha da Gama F, eds. Location Science (Springer, Cham, Switzerland), 327–363.Google Scholar
• Contreras I, Cordeau JF, Laporte G (2011a) Benders decomposition for large-scale uncapacitated hub location. Oper. Res. 59(6):1477–1490.Link, Google Scholar
• Contreras I, Cordeau JF, Laporte G (2011b) Stochastic uncapacitated hub location. Eur. J. Oper. Res. 212(3):518–528.Crossref, Google Scholar
• Contreras I, Cordeau JF, Laporte G (2012) Exact solution of large-scale hub location problems with multiple capacity levels. Transportation Sci. 46(4):439–459.Link, Google Scholar
• Contreras I, Fernández E, Marín A (2010) The tree of hubs location problem. Eur. J. Oper. Res. 202(2):390–400.Crossref, Google Scholar
• Correia I, Nickel S, Saldanha-da Gama F (2010) Single-assignment hub location problems with multiple capacity levels. Transportation Res. Part B: Methodological 44(8–9):1047–1066.Crossref, Google Scholar
• Dantzig GB, Wolfe P (1960) Decomposition principle for linear programs. Oper. Res. 8(1):101–111.Link, Google Scholar
• de Camargo RS, Miranda G (2012) Single allocation hub location problem under congestion: Network owner and user perspectives. Expert Systems Appl. 39(3):3385–3391.Crossref, Google Scholar
• De Camargo RS, de Miranda G Jr, Ferreira RP (2011) A hybrid outer-approximation/benders decomposition algorithm for the single allocation hub location problem under congestion. Oper. Res. Lett. 39(5):329–337.Crossref, Google Scholar
• de Camargo RS, de Miranda G Jr, O’Kelly ME, Campbell JF (2017) Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints. Appl. Math. Modeling 51:274–301.Crossref, Google Scholar
• de Camargo RS, Miranda G, Ferreira RPM, Luna HP (2009) Multiple allocation hub-and-spoke network design under hub congestion. Comput. Oper. Res. 36(12):3097–3106.Crossref, Google Scholar
• de Sá EM, de Camargo RS, de Miranda G (2013) An improved benders decomposition algorithm for the tree of hubs location problem. Eur. J. Oper. Res. 226(2):185–202.Crossref, Google Scholar
• de Sá EM, Morabito R, de Camargo RS (2018) Benders decomposition applied to a robust multiple allocation incomplete hub location problem. Comput. Oper. Res. 89:31–50.Crossref, Google Scholar
• Desaulniers G, Solomon MM, Desrosiers J (2005) Column Generation (Springer, Berlin).Crossref, Google Scholar
• Di Crescenzo A, Giorno V, Kumar BK, Nobile AG (2018) M/m/1 queue in two alternating environments and its heavy traffic approximation. J. Math. Anal. Appl. 465(2):973–1001.Crossref, Google Scholar
• Ebery J, Krishnamoorthy M, Ernst A, Boland N (2000) The capacitated multiple allocation hub location problem: Formulations and algorithms. Eur. J. Oper. Res. 120(3):614–631.Crossref, Google Scholar
• Elhedhli S, Hu FX (2005) Hub-and-spoke network design with congestion. Comput. Oper. Res. 32(6):1615–1632.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(2):282–296.Link, Google Scholar
• Ernst A, Krishnamoorthy M (1999) Solution algorithms for the capacitated single allocation hub location problem. Ann. Oper. Res. 86:141–159.Crossref, Google Scholar
• Ernst AT, Krishnamoorthy M (1996) Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Sci. 4(3):139–154.Google Scholar
• FAA (1976) Techniques for determining airport airside capacity and delay. Technical report, U.S. Department of Transportation, Federal Aviation Administration, Washington, DC.Google Scholar
• Farahani RZ, Hekmatfar M, Arabani AB, Nikbakhsh E (2013) Hub location problems: A review of models, classification, solution techniques, and applications. Comput. Industrial Engrg. 64(4):1096–1109.Crossref, Google Scholar
• Forbes (2019) Airlines struggle to cope with rush-hour-style congestion. Accessed January 21, 2021, https://www.forbes.com/sites/oliverwyman/2019/09/19/airlines-struggle-to-cope-with-rush-hour-style-congestion/?sh=4bec21c12594.Google Scholar
• Geoffrion AM (1972) Generalized benders decomposition. J. Optim. Theory Appl. 10(4):237–260.Crossref, Google Scholar
• Grove PG, O’Kelly ME (1986) Hub networks and simulated schedule delay. Papers Regulatory Sci. 59(1):103–119.Crossref, Google Scholar
• Guldmann JM, Shen G (1997) A general mixed integer nonlinear optimization model for hub network design. Proc. 44th North Amer. Meeting of the Regional Sci. Assoc Internat. 6–9.Google Scholar
• Günlük O, Linderoth J (2008) Perspective relaxation of mixed integer nonlinear programs with indicator variables. Lodi A, Panconesi A, Rinaldi G, eds. Integer Programming and Combinatorial Optimization (Springer, Berlin), 1–16.Crossref, Google Scholar
• Hübl A, Altendorfer K (2015) State probabilities for an m/m/1 queuing system with two capacity levels. Proc. Winter Simulation Conf. (IEEE, New York), 2219–2226.Google Scholar
• IBM (2019) IBM ILOG CPLEX Optimization Studio V12.10.0. Accessed December 22, 2019, https://www.ibm.com/products/ilog-cplex-optimization-studio.Google Scholar
• Ignaccolo M (2003) A simulation model for airport capacity and delay analysis. Transportation Planning Tech. 26(2):135–170.Crossref, Google Scholar
• Ishfaq R, Sox CR (2012) Design of intermodal logistics networks with hub delays. Eur. J. Oper. Res. 220(3):629–641.Crossref, Google Scholar
• Jittrapirom P, Caiati V, Feneri AM, Ebrahimigharehbaghi S, González M, Narayan J (2017) Mobility as a service: A critical review of definitions, assessments of schemes, and key challenges. Urban Planning 2(2):13–25.Crossref, Google Scholar
• Kara BY (2011) Hub location Accessed September 4, 2019, https://ie.bilkent.edu.tr/bkara/hub_location.php.Google Scholar
• Kian R, Kargar K (2016) Comparison of the formulations for a hub-and-spoke network design problem under congestion. Comput. Industrial Engrg. 101:504–512.Crossref, Google Scholar
• Kızıl KU, Yıldız B (2023) Public transport-based crowd-shipping with backup transfers. Transportation Sci. 57(1):174–196.Link, Google Scholar
• Kleinrock L (1964) Communication Nets: Stochastic Message Flow and Delay (McGraw-Hill, New York).Google Scholar
• Klincewicz JG (1998) Hub location in backbone/tributary network design: A review. Location Sci. 6(1):307–335.Crossref, Google Scholar
• Little JD (1961) A proof for the queuing formula: L= λ w. Oper. Res. 9(3):383–387.Link, Google Scholar
• Lobo MS, Vandenberghe L, Boyd S, Lebret H (1998) Applications of second-order cone programming. Linear Algebra Appl. 284(1):193–228.Crossref, Google Scholar
• Macrina G, Pugliese LDP, Guerriero F, Laporte G (2020) Crowd-shipping with time windows and transshipment nodes. Comput. Oper. Res. 113:104806.Crossref, Google Scholar
• Marianov V, Serra D (2003) Location models for airline hubs behaving as M/D/c queues. Comput. Oper. Res. 30(7):983–1003.Crossref, Google Scholar
• Marín A, Nickel S, Schöbel A, Sonneborn T (2002) Extensions of the uncapacitated hub location problem for applications in intermodal public transportation. Proc. 13th Mini-EURO Conf. and IX Meeting of the EURO Working Group on Transportation.Google Scholar
• Mayer C, Sinai T (2003) Network effects, congestion externalities, and air traffic delays: Or why not all delays are evil. Amer. Econom. Rev. 93(4):1194–1215.Crossref, Google Scholar
• Meraklı M, Yaman H (2016) Robust intermodal hub location under polyhedral demand uncertainty. Transportation Res. Part B: Methodological 86:66–85.Crossref, Google Scholar
• Meraklı M, Yaman H (2017) A capacitated hub location problem under hose demand uncertainty. Comput. Oper. Res. 88:58–70.Crossref, Google Scholar
• Meuffels WJM (2015) The design of road and air networks for express service providers. PhD thesis, Tilburg University, Tilburg, The Netherlands.Google Scholar
• Michail D, Kinable J, Naveh B, Sichi JV (2019) Jgrapht: A java library for graph data structures and algorithms. Preprint, submitted April 17, https://arxiv.org/abs/ 1904.08355.Google Scholar
• Montreuil B (2011) Toward a physical Internet: Meeting the global logistics sustainability grand challenge. Logist. Res. 3(2–3):71–87.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
• Nesterov Y, Nemirovskii AS, Ye Y (1994) Interior-Point Polynomial Algorithms in Convex Programming, vol. 13 (SIAM, Philadelphia).Crossref, Google Scholar
• Nickel S, Schöbel A, Sonneborn T (2001) Hub location problems in urban traffic networks. Mathematical Methods on Optimization in Transportation Systems (Springer, Berlin), 95–107.Crossref, Google Scholar
• Odoni AR, Roth E (1983) An empirical investigation of the transient behavior of stationary queueing systems. Oper. Res. 31(3):432–455.Link, Google Scholar
• O’Kelly ME (1986a) Activity levels at hub facilities in interacting networks. Geographical Anal. 18(4):343–356.Crossref, Google Scholar
• O’Kelly ME (1986b) The location of interacting hub facilities. Transportation Sci. 20(2):92–106.Link, Google Scholar
• O’Kelly ME, Campbell JF, de Camargo RS, de Miranda G Jr (2015) Multiple allocation hub location model with fixed arc costs. Geographical Anal. 47(1):73–96.Crossref, Google Scholar
• Pérez JMQ, Lange JC, Tancrez JS (2018) A multi-hub express shipment service network design model with flexible hub assignment. Transportation Res., Part E Logist. Transportation Rev. 120:116–131.Crossref, Google Scholar
• Potra FA, Wright SJ (2000) Interior-point methods. J. Comput. Appl. Math. 124(1):281–302.Crossref, Google Scholar
• Pyrgiotis N, Malone KM, Odoni A (2013) Modelling delay propagation within an airport network. Transportation Res., Part C Emerging Tech. 27:60–75.Crossref, Google Scholar
• Rahmaniani R, Crainic TG, Gendreau M, Rei W (2017) The benders decomposition algorithm: A literature review. Eur. J. Oper. Res. 259(3):801–817.Crossref, Google Scholar
• Rodríguez-Martín I, Salazar-González JJ (2008) Solving a capacitated hub location problem. Eur. J. Oper. Res. 184(2):468–479.Crossref, Google 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.Crossref, Google Scholar
• Salimian M (2013) A mixed integer second order cone programming reformulation for a congested location and capacity allocation problem in supply chain network design. MS thesis, Middle East Technical University, Ankara, Turkey.Google Scholar
• Schwarz JA, Selinka G, Stolletz R (2016) Performance analysis of time-dependent queueing systems: Survey and classification. Omega 63:170–189.Crossref, Google Scholar
• Şen A, Atamtürk A, Kaminsky P (2018) A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model. Oper. Res. 66(4):994–1003.Link, 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(6):1446–1470.Link, Google Scholar
• TAM (1964) Traffic Assignment Manual (Bureau of Public Roads, U.S. Department of Commerce, Washington, DC).Google Scholar
• Tanash M, Contreras I, Vidyarthi N (2017) An exact algorithm for the modular hub location problem with single assignments. Comput. Oper. Res. 85:32–44.Crossref, Google Scholar
• van Essen JT (2009) Heuristics for the hub location and network design problem with a mixed vehicle fleet. MS thesis, Delft University of Technology, Delft, The Netherlands.Google Scholar
• Yaman H (2008) Star p-hub median problem with modular arc capacities. Comput. Oper. Res. 35(9):3009–3019.Crossref, Google Scholar
• Yaman H, Carello G (2005) Solving the hub location problem with modular link capacities. Comput. Oper. Res. 32(12):3227–3245.Crossref, Google Scholar
• Yaman H, Kara BY, Tansel BC (2007) The latest arrival hub location problem for cargo delivery systems with stopovers. Transportation Res. Part B: Methodological 41(8):906–919.Crossref, Google Scholar
• Yıldız B, Karaşan OE, Yaman H (2018) Branch-and-price approaches for the network design problem with relays. Comput. Oper. Res. 92:155–169.Crossref, Google Scholar
• Yildiz B, Yaman H, Karasan O (2021) Hub location, routing and route dimensioning: Strategic and tactical intermodal transportation hub network design. Transportation Sci. 55(6):1351–1369.Link, Google Scholar