Toward a Reference Experimental Benchmark for Solving Hub Location Problems

References

• Abyazi-Sani R, Ghanbari R (2016) An efficient tabu search for solving the uncapacitated single allocation hub location problem. Comput. Industrial Engrg. 93:99–109.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 S, Campbell J, Contreras I, Kara B, Marianov V, O’Kelly M (2021) Perspectives on modeling hub location problems. Eur. J. Oper. Res. 291(1):1–17.Crossref, Google Scholar
• An Yu, Zhang Y, Zeng B (2015) The reliable hub-and-spoke design problem: Models and algorithms. Transportation Res. Part B: Methodological 77:103–122.Crossref, Google Scholar
• An Yu, Zeng B, Zhang Y, Zhao L (2014) Reliable p-median facility location problem: Two-stage robust models and algorithms. Transportation Res. Part B: Methodological 64:54–72.Crossref, Google Scholar
• Azizi N, Chauhan S, Salhi S, Vidyarthi N (2016) The impact of hub failure in hub-and-spoke networks: Mathematical formulations and solution techniques. Comput. Oper. Res. 65:174–188.Crossref, Google Scholar
• Bashiri M, Mirzaei M, Randall M (2013) Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution. Appl. Math. Modeling 37(5):3513–3525.Crossref, Google Scholar
• Brimberg J, Mladenović N, Todosijević R, Urošević D (2017) General variable neighborhood search for the uncapacitated single allocation p-hub center problem. Optim. Lett. 11(2):377–388.Crossref, Google Scholar
• Bryan DL, O’Kelly ME (1999) Hub-and-spoke networks in air transportation: An analytical review. J. Regional Sci. 39(2):275–295.Crossref, Google Scholar
• Calik H, Alumur SA, Kara BY, Karasan OE (2009) A tabu-search based heuristic for the hub covering problem over incomplete hub networks. Comput. Oper. Res. 36(12):3088–3096.Crossref, Google Scholar
• Campbell JF (1994) Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72(2):387–405.Crossref, Google Scholar
• Campbell JF (2013) Modeling economies of scale in transportation hub networks. Proc. 46th Hawaii Internat. Conf. on System Sciences, 1154–1163.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 (2005) Hub arc location problems: Part I: Introduction and results. Management Sci. 51(10):1540–1555.Link, Google Scholar
• Çetiner S (2003) An iterative hub location and routing problem for postal delivery systems. PhD thesis, Middle East Technical University, Ankara, Turkey.Google Scholar
• Chetlur S, Woolley C, Vandermersch P, Cohen J, Tran J, Catanzaro B, Shelhamer E (2014) cuDNN: Efficient Primitives for Deep Learning. Preprint, submitted October 3, https://arxiv.org/abs/1410.0759.Google Scholar
• Contreras I (2015) Hub Location Problems (Springer International Publishing, Cham, Switzerland).Crossref, 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, Díaz JA, Fernández E (2009a) Lagrangean relaxation for the capacitated hub location problem with single assignment. OR Spectrum 31(3):483–505.Crossref, 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, Fernández E, Marín A (2009b) Tight bounds from a path based formulation for the tree of hub location problem. Comput. Oper. Res. 36(12):3117–3127.Crossref, Google Scholar
• Corberán Á, Peiró J, Campos V, Glover F, Martí R (2016) Strategic oscillation for the capacitated hub location problem with modular links. J. Heuristics 22(2):221–244.Crossref, Google Scholar
• Correia I, Nickel S, Saldanha da Gama F (2010) The capacitated single-allocation hub location problem revisited: A note on a classical formulation. Eur. J. Oper. Res. 207(1):92–96.Crossref, Google Scholar
• Cui T, Ouyang Y, Shen ZJM (2010) Reliable facility location design under the risk of disruptions. Oper. Res. 58(4-part-1):998–1011.Link, Google Scholar
• Cui H, Zhang H, Ganger GR, Gibbons PB, Xing EP (2016) Geeps: Scalable deep learning on distributed gpus with a gpu-specialized parameter server. Proc. 11th Eur. Conf. Comput. Systems (Association for Computing Machinery, New York), 1–16.Google Scholar
• Cunha CB, Silva MR (2007) A genetic algorithm for the problem of configuring a hub-and-spoke network for an LTL trucking company in Brazil. Eur. J. Oper. Res. 179(3):747–758.Crossref, Google Scholar
• Dai H, Khalil EB, Zhang Y, Le Song DB (2017) Learning combinatorial optimization algorithms over graphs. Preprint, submitted April 5, https://arxiv.org/abs/1704.01665.Google Scholar
• de Camargo RS, de Miranda G, Henrique Pacca LL (2009) Benders decomposition for hub location problems with economies of scale. Transportation Sci. 43(1):86–97.Link, Google Scholar
• de Camargo RS, de Miranda G, Luna HP (2008) Benders decomposition for the uncapacitated multiple allocation hub location problem. Comput. Oper. Res. 35(4):1047–1064.Crossref, Google Scholar
• de Camargo RS, de Miranda G, 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 Sá EM, Contreras I, Cordeau J-F (2015) Exact and heuristic algorithms for the design of hub networks with multiple lines. Eur. J. Oper. Res. 246(1):186–198.Crossref, Google Scholar
• de Sá EM, Morabito R, Saraiva de Camargo R (2018) Benders decomposition applied to a robust multiple allocation incomplete hub location problem. Comput. Oper. Res. 89:31–50.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, 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 AT, Krishnamoorthy M (1996) Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Sci. 4(3):139–154.Crossref, Google Scholar
• Ernst AT, Krishnamoorthy M (1998) Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. Eur. J. Oper. Res. 104(1):100–112.Crossref, Google Scholar
• Ernst AT, Krishnamoorthy M (1999) Solution algorithms for the capacitated single allocation hub location problem. Ann. Oper. Res. 86(0):141–159.Crossref, Google Scholar
• Ernst AT, Hamacher H, Jiang H, Krishnamoorthy M, Woeginger G (2009) Uncapacitated single and multiple allocation p-hub center problems. Comput. Oper. Res. 36(7):2230–2241.Crossref, Google Scholar
• Fan C, Zeng L, Sun Y, Liu Y-Y (2020) Finding key players in complex networks through deep reinforcement learning. Nature Machine Intelligence 2(6):1–8.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
• Figueiredo RMA, O’Kelly ME, Pizzolato ND (2014) A two-stage hub location method for air transportation in Brazil. Internat. Transportation Oper. Res. 21(2):275–289.Crossref, Google Scholar
• Fisher ML (2004) The Lagrangian relaxation method for solving integer programming problems. Management Sci. 50(12, suppl):1861–1871.Link, Google Scholar
• Gelareh S, Nickel S (2011) Hub location problems in transportation networks. Transportation Res., Part E Logistical Transporation Rev. 47(6):1092–1111.Crossref, Google Scholar
• Gelareh S, Monemi RN, Nickel S (2015) Multi-period hub location problems in transportation. Transporation Res., Part E Logistical Transportation Rev. 75:67–94.Crossref, Google Scholar
• Ghaffari-Nasab N, Ghazanfari M, Saboury A, Fathollah M (2015) The single allocation hub location problem: A robust optimisation approach. Eur. J. Industrial Engrg. 9(2):147–170.Crossref, Google Scholar
• Ghaffarinasab N, Kara BY (2019) Benders decomposition algorithms for two variants of the single allocation hub location problem. Network Spatial Econom. 19(1):83–108.Crossref, Google Scholar
• Hoff A, Peiró J, Corberán Á, Martí R (2017) Heuristics for the capacitated modular hub location problem. Comput. Oper. Res. 86:94–109.Crossref, Google Scholar
• Huynh LN, Lee Y, Balan RK (2017) Deepmon: Mobile gpu-based deep learning framework for continuous vision applications. Proc. 15th Annual Internat. Conf. on Mobile Systems, Applications, and Services (Association for Computing Machinery, New York), 82–95.Google Scholar
• Ilić A, Urošević D, Brimberg J, Mladenović N (2010) A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. Eur. J. Oper. Res. 206(2):289–300.Crossref, Google Scholar
• Karimi H (2018) The capacitated hub covering location-routing problem for simultaneous pickup and delivery systems. Comput. Industrial Engrg. 116:47–58.Crossref, Google Scholar
• Kim H, O’Kelly ME (2009) Reliable p-hub location problems in telecommunication networks. Geographical Anal. 41(3):283–306.Crossref, Google Scholar
• Klincewicz JG (1998) Hub location in backbone/tributary network design: A review. Location Sci. 6(1):307–335.Crossref, Google Scholar
• Kratica J, Milanović M, Stanimirović Z, Tošić D (2011) An evolutionary-based approach for solving a capacitated hub location problem. Appl. Soft Comput. 11(2):1858–1866.Crossref, Google Scholar
• Kratica J, Stanimirović Z, Tošić D, Filipović V (2005) Genetic algorithm for solving uncapacitated multiple allocation hub location problem. Comput. Inform. 24:427–440.Google Scholar
• Labbé M, Yaman H, Gourdin E (2005) A branch and cut algorithm for hub location problems with single assignment. Math. Programming 102(2):371–405.Crossref, Google Scholar
• Ling Z, Tao X, Zhang Y, Che X (2020) Solving optimization problems through fully convolutional networks: An application to the traveling salesman problem. IEEE Trans. Systems Man Cybernetics, https://ieeexplore.ieee.org/abstract/document/8994181.Google Scholar
• Meier JF, Clausen U (2018) Solving single allocation hub location problems on Euclidean data. Transportation Sci. 52(5):1141–1155.Link, Google Scholar
• O’Kelly ME (1986) The location of interacting hub facilities. Transportation Sci. 20(2):92–106.Link, Google Scholar
• O’Kelly ME (1987) A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32(3):393–404.Crossref, Google Scholar
• O’Kelly ME (2012) Fuel burn and environmental implications of airline hub networks. Transporation Res. Part D Transportation Environment 17(7):555–567.Crossref, Google Scholar
• O’Kelly ME, Miller HJ (1994) The hub network design problem: A review and synthesis. J. Transportation Geography 2(1):31–40.Crossref, Google Scholar
• O’Kelly ME, Campbell JF, Camargo RS, Miranda G (2015) Multiple allocation hub location model with fixed arc costs. Geographical Anal. 47(1):73–96.Crossref, Google Scholar
• Peiró J, Corberán Á, Martí R (2014) GRASP for the uncapacitated r-allocation p-hub median problem. Comput. Oper. Res. 43:50–60.Crossref, Google Scholar
• Peker M, Kara BY, Campbell JF, Alumur SA (2015) Spatial analysis of single allocation hub location problems. Network Spatial Econom. 16(4):1–27.Google Scholar
• Randall M (2008) Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation. Comput. Optim. Appl. 39(2):239–261.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
• Rodríguez-Martín I, Salazar-González J-J, Yaman H (2014) A branch-and-cut algorithm for the hub location and routing problem. Comput. Oper. Res. 50:161–174.Crossref, Google Scholar
• Skorin-Kapov D, Skorin-Kapov J (1994) On tabu search for the location of interacting hub facilities. Eur. J. Oper. Res. 73(3):502–509.Crossref, Google Scholar
• Stanimirović Z (2012) A genetic algorithm approach for the capacitated single allocation p-hub median problem. Comput. Inform. 29(1):117–132.Google Scholar
• Sun X, Dai W, Zhang Y, Wandelt S (2017) Finding p-hub median locations: An empirical study on problems and solution techniques. J. Adv. Transportation 2017:1–23.Crossref, Google Scholar
• Thomadsen T, Larsen J (2007) A hub location problem with fully interconnected backbone and access networks. Comput. Oper. Res. 34(8):2520–2531.Crossref, Google Scholar
• Todosijević R, Urošević D, Mladenović N, Hanafi S (2017) A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem. Optim. Lett. 11(6):1109–1121.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
• Yang K, Liu Y, Yang G (2013) An improved hybrid particle swarm optimization algorithm for fuzzy p-hub center problem. Comput. Industrial Engrg. 64(1):133–142.Crossref, Google Scholar