Skip to main content
SpringerLink
Log in

Hub Location Problems

  • Chapter
  • First Online:
Location Science

Abstract

Hub Location Problems (HLPs) lie at the heart of network design planning in transportation and telecommunication systems. They constitute a challenging class of optimization problems that focus on the location of hub facilities and on the design of hub networks. This chapter overviews the key distinguishing features, assumptions and properties commonly considered in HLPs. We highlight the role location and network design decisions play in the formulation and solution of HLPs. We also provide a concise overview of the main developments and most recent trends in hub location research. We cover various topics such as hub network topologies, flow dependent discounted costs, capacitated models, uncertainty, dynamic and multi-modal models, and competition and collaboration. We also include a summary of the most successful integer programming formulations and efficient algorithms that have been recently developed for the solution of HLPs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Adler N, Smilowitz K (2007) Hub-and-spoke network alliances and mergers: price-location competition in the airline industry. Transp Res B Methodol 41:394–409

    Article  Google Scholar 

  • Alibeyg A, Contreras I, Fernández E (2016) Hub network design with profits, Transport Res E-Log 96:40–59

    Article  MATH  Google Scholar 

  • Alibeyg A, Contreras I, Fernández E (2018) Exact solution of hub network design problems with profits, Eur J Oper Res 266:57–71

    Article  MathSciNet  MATH  Google Scholar 

  • Alumur S, Kara BY (2008) Network hub location problems: the state of the art. Eur J Oper Res 190:1–21

    Article  MathSciNet  MATH  Google Scholar 

  • Alumur S, Kara BY, Karasan OE (2009) The design of incomplete single allocation hub networks. Transp Res B Methodol 43:936–951

    Article  Google Scholar 

  • Alumur S, Kara BY, Karasan OE (2012a) Multimodal hub location and hub network design. Omega 40:927–939

    Article  Google Scholar 

  • Alumur S, Nickel S, Saldanha-da-Gama F (2012b) Hub location under uncertainty. Transp Res B Methodol 46:529–543

    Article  Google Scholar 

  • Alumur S, Yaman H, Kara BY (2012c) Hierarchical multimodal hub location problem with time-definite deliveries. Transport Res E-Log 48:1107–1120

    Article  Google Scholar 

  • Alumur SA, Nickel S, Saldanha-da-Gama F, Secerdin Y (2016) Multi-period hub network design problems with modular capacities. Ann Oper Res 246:289–312

    Article  MathSciNet  MATH  Google Scholar 

  • An Y, Zhang Y, Zeng B (2015) The reliable hub-and-spoke design problem: models and algorithms. Transp Res B Methodol 77:103–122

    Article  Google Scholar 

  • Asgari N, Zanjirani Farahani R, Goh M (2013) Network design approach for hub ports-shipping companies competition and cooperation. Transp Res A Policy Pract 48:1–18

    Article  Google Scholar 

  • Aykin T (1988) On the location of hub facilities. Transport Sci 22:155–157

    Article  MathSciNet  MATH  Google Scholar 

  • Aykin T (1994) Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem. Eur J Oper Res 79:501–523

    Article  MATH  Google Scholar 

  • Aykin T (1995) Networking policies for hub-and-spoke systems with applications to the air transportation system. Transport Sci 3:201–221

    Article  MATH  Google Scholar 

  • Aziz N, Chauhan 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

    Article  MathSciNet  MATH  Google Scholar 

  • Aziz N, Vidyarthi N, Chauhan S (2018) Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion. Ann Oper Res 264:1–2

    Article  MathSciNet  MATH  Google Scholar 

  • Boland N, Krishnamoorthy M, Ernst AT, Ebery J (2004) Preprocessing and cutting for multiple allocation hub location problems. Eur J Oper Res 155:638–653

    Article  MathSciNet  MATH  Google Scholar 

  • Bryan DL (1998) Extensions to the hub location problem: Formulations and numerical examples. Geogr Anal 30:315–330

    Article  Google Scholar 

  • Bryan DL, O’Kelly ME (1999) Hub-and-spoke networks in air transportation: An analytical review. J Regional Sci 39:275–295

    Article  Google Scholar 

  • Çalık 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:3088–3096

    Article  MATH  Google Scholar 

  • Camargo RS, Miranda Jr G (2012) Single allocation hub location problem under congestion: network owner and user perspectives. Expert Syst Appl 39:3385–3391

    Article  Google Scholar 

  • Camargo RS, Miranda Jr G, Luna HP (2009) Benders decomposition for hub location problems with economies of scale. Transport Sci 43:86–97

    Article  Google Scholar 

  • Camargo RS, Miranda Jr G, Ferreira RPM, Luna HP (2009) Multiple allocation hub-and-spoke network design under hub congestion. Comput Oper Res 36:3097–3106

    Article  MATH  Google Scholar 

  • Camargo RS, Miranda Jr G, Ferreira RPM (2011) A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion. Oper Res Lett 39:329–337

    Article  MathSciNet  MATH  Google Scholar 

  • Camargo RS, Miranda Jr G, Lokketagen A (2013) A new formulation and an exact approach for the many-to-many hub location-routing problem. Appl Math Model 37:12–13

    Article  MathSciNet  Google Scholar 

  • Campbell JF (1990) Locating transportation terminals to serve an expanding demand. Transp Res B Methodol 3:173–192

    Article  Google Scholar 

  • Campbell JF (1994a) A survey of network hub location. Stud Locat Anal 6:31–43

    Google Scholar 

  • Campbell JF (1994b) Integer programming formulations of discrete hub location problems. Eur J Oper Res 72:387–405

    Article  MATH  Google Scholar 

  • Campbell JF (1996) Hub location and the p-hub median problem. Oper Res 44:923–935

    Article  MathSciNet  MATH  Google Scholar 

  • Campbell JF (2013) A continuous approximation model for time definite many-to-many transportation. Transp Res B Methodol 54:100-112

    Article  Google Scholar 

  • Campbell JF, O’Kelly ME (2012) Twenty-five years of hub location research. Transport Sci 46:153–169

    Article  Google Scholar 

  • Campbell JF, Ernst AT, Krishnamoorthy M (2001) Hub location problems. In: Drezner Z, Hamacher HW (eds) Facility Location. Applications and Theory. Springer, Heidelberg, pp 373–408

    Google Scholar 

  • Campbell JF, Ernst AT, Krishnamoorthy M (2005a) Hub arc location problems: part I Introduction and results. Manage Sci 51:1540–55

    Article  MATH  Google Scholar 

  • Campbell JF, Ernst AT, Krishnamoorthy M (2005b) Hub arc location problems: part II formulations and optimal algorithms. Manage Sci 51:1556–71

    Article  MATH  Google Scholar 

  • Campbell AM, Lowe TJ, Zhang L (2007) The p-hub center allocation problem. Eur J Oper Res 176:819–835

    Article  MathSciNet  MATH  Google Scholar 

  • Cánovas L, Garcia S, Marín A (2007) Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique. Eur J Oper Res 179:990–1007

    Article  MathSciNet  MATH  Google Scholar 

  • Carello G, Della Croce F, Ghirardi M, Tadel R (2004) Solving the hub location problem in telecommunications network design: a local search approach. Networks 44:94–105

    Article  MathSciNet  MATH  Google Scholar 

  • Catanzaro D, Gourdin É, Labbé M, Ozsoy FA (2011) A branch-and-cut algorithm for the partitioning-hub location-routing problem. Comput Oper Res 38:539–549

    Article  MathSciNet  MATH  Google Scholar 

  • Contreras I, Fernández E (2012) General network design: a unified view of combined location and network design problems. Eur J Oper Res 219:680–697

    Article  MathSciNet  MATH  Google Scholar 

  • Contreras I, Fernández E (2014) Hub location as the minimization of a supermodular set function. Oper Res 62:557–570

    Article  MathSciNet  MATH  Google Scholar 

  • Contreras I, Díaz JA, Fernández E (2009a) Lagrangean relaxation for the capacitated hub location problem with single assignment. OR Spectr 31:483–505

    Article  MathSciNet  MATH  Google Scholar 

  • Contreras I, Cordeau J-F, Laporte G (2011a) Stochastic uncapacitated hub location. Eur J Oper Res 212:518–528

    Article  MathSciNet  MATH  Google Scholar 

  • Contreras I, Cordeau J-F, Laporte G (2011b) Benders decomposition for large-scale uncapacitated hub location. Oper Res 9:1477–1490

    Article  MathSciNet  MATH  Google Scholar 

  • Contreras I, Cordeau J-F, Laporte G (2011c) The dynamic uncapacitated hub location problem. Transport Sci 45:18–32

    Article  MATH  Google Scholar 

  • Contreras I, Díaz JA, Fernández E (2011d) Branch and price for large-scale capacitated hub location problems with single assignment. INFORMS J Comput 23:41–55

    Article  MathSciNet  MATH  Google Scholar 

  • Contreras I, Fernández E, Marín A (2009) Tight bounds from a path based formulation for the tree of hubs location problem. Comput Oper Res 36:3117–3127

    Article  MATH  Google Scholar 

  • Contreras I, Fernández E, Marín A (2010) The tree of hubs location problem. Eur J Oper Res 202:390–400

    Article  MATH  Google Scholar 

  • Contreras I, Cordeau J-F, Laporte G (2012) Exact solution of large-scale hub location problems with multiple capacity levels. Transport Sci 46:439–459

    Article  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

    Google Scholar 

  • Correia I, Nickel S, Saldanha-da-Gama F (2010a) Single-assignment hub location problems with multiple capacity levels. Transp Res B Methodol 44:1047–1066

    Article  Google Scholar 

  • Correia I, Nickel S, Saldanha-da-Gama F (2010b) The capacitated single-allocation hub location problem revisited: a note on a classical formulation. Eur J Oper Res 207:92–96

    Article  MathSciNet  MATH  Google Scholar 

  • Correia I, Nickel S, Saldanha-da-Gama F (2018) A stochastic multi-period capacitated multiple allocation hub location problem: formulation and inequalities. Omega 74:122–134

    Article  Google Scholar 

  • Costa MG, Captivo ME, Climaco J (2008) Capacitated single allocation hub location problem—a bi-criteria approach. Comput Oper Res 35:3671–3695

    Article  MATH  Google Scholar 

  • Cunha CB, Silva MR (2007) A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil. Eur J Oper Res 179:747–758

    Article  MATH  Google Scholar 

  • Dukkanci O, Kara BY (2017) Routing and scheduling decisions in the hierarchical hub location problem. Comput Oper Res 85:45–57

    Article  MathSciNet  MATH  Google Scholar 

  • Ebery J, Krishnamoorthy M, Ernst AT, Boland N (2000) The capacitated multiple allocation hub location problem: formulations and algorithms. Eur J Oper Res 120:614–631

    Article  MATH  Google Scholar 

  • Elhedhli S, Hu FX (2005) Hub-and-spoke network design with congestion. Comput Oper Res 32:1615–1632

    Article  MATH  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

    Article  MathSciNet  MATH  Google Scholar 

  • Eiselt HA, Marianov V (2009) A conditional p-hub location problem with attraction functions. Comput Oper Res 36:3128–3135

    Article  MATH  Google Scholar 

  • Ernst AT, Hamacher HW, Jiang H, Krishnamoorthy M, Woenginger G (2009) Uncapacitated single and multiple allocation p-hub center problems. Comput Oper Res 36:2230–2241

    Article  MathSciNet  MATH  Google Scholar 

  • Ernst AT, Krishnamoorthy M (1996) Efficient algorithms for the uncapacitated single allocation p-hub median problem. Loc Sci 4:139–154

    Article  MATH  Google Scholar 

  • Ernst AT, Krishnamoorthy M (1998a) An exact solution approach based on shortest-paths for p-hub median problems. INFORMS J Comput 10:149–162

    Article  MathSciNet  MATH  Google Scholar 

  • Ernst AT, Krishnamoorthy M (1998b) Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problems. Eur J Oper Res 104:100–112

    Article  MATH  Google Scholar 

  • Ernst AT, Krishnamoorthy M (1999) Solution algorithms for the capacitated single allocation hub location problem. Ann Oper Res 86:141–159

    Article  MathSciNet  MATH  Google Scholar 

  • García S, Landete M, Marín A (2012) New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem. Eur J Oper Res 220:48–57

    Article  MathSciNet  MATH  Google Scholar 

  • Gelareh S, Nickel S (2011) Hub location in transportation networks. Transport Res E-Log 47:1092–1111

    Article  Google Scholar 

  • Gelareh S, Pisinger D (2011) Fleet deployment, network design and hub location of liner shipping companies. Transport Res E-Log 47:947–964

    Article  Google Scholar 

  • Gelareh S, Nickel S, Pisinger D (2010) Liner shipping hub network design in a competitive environment. Transport Res E-Log 46:991–1004

    Article  Google Scholar 

  • Gelareh S, Monemi RN, Nickel S (2015) Multi-period hub location problems in transportation. Transport Res E-Log 75:67–94

    Article  Google Scholar 

  • Gendron B, Crainic TG, Frangioni A (1999) Multicommodity capacitated network design. In: Sansó B, Soriano P (eds) Telecommunications Network planning. Kluwer, Norwell, pp 1–19

    Google Scholar 

  • Groothedde B, Ruijgrok C, Tavasszy L (2005) Towards collaborative, intermodal hub networks: a case study in the fast moving consumer good market. Transport Res E-Log 41:567–583

    Article  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

    Article  MathSciNet  MATH  Google Scholar 

  • Hamacher HW, Labbé M, Nickel S, Sonneborn T (2004) Adapting polyhedral properties from facility to hub location problems. Discrete Appl Math 145:104–116

    Article  MathSciNet  MATH  Google Scholar 

  • Hoff A, Peiró J, Corberán A, Martí, R (2017) Heuristics for the capacitated modular hub location problem. Comput Oper Res 86:94–109

    Article  MathSciNet  MATH  Google Scholar 

  • Horner MW, O’Kelly ME (2001) Embedding economies of scale concepts for hub network design. J Transp Geogr 9:255–265

    Article  Google Scholar 

  • Hwang YH, Lee YH (2013) Uncapacitated single allocation p-hub maximal covering problem. Comput Ind Eng 63:382–389

    Article  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:289–300

    Article  MathSciNet  MATH  Google Scholar 

  • Ishfaq R, Sox CR (2011) Hub location-allocation in intermodal logistic networks. Eur J Oper Res 210:213–230

    Article  MathSciNet  MATH  Google Scholar 

  • Iwasa M, Saito H, Matsui T (2009) Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems. Discrete Appl Math 157:2078–2088

    Article  MathSciNet  MATH  Google Scholar 

  • Kara BY, Tansel BÇ (2000) On the single-assignment p-hub center problem. Eur J Oper Res 125:648–655

    Article  MATH  Google Scholar 

  • Kara BY, Tansel BÇ (2003) The single-assignment hub covering problem: models and linearizations. J Oper Res Soc 54:59–64

    Article  MATH  Google Scholar 

  • Kim H, O’Kelly ME (2009) Reliable p-hub location problem in telecommunication networks. Geogr Anal 41:283–306

    Article  Google Scholar 

  • Kim J-G, Tcha D-W (1992) Optimal design of a two-level hierarchical network with tree-star configuration. Comput Ind Eng 22:273–281

    Article  Google Scholar 

  • Kimms A (2006) Economies of scale in hub and spoke network design: we have it all wrong. In: Morlock M, Schwindt C, Trautmann N, Zimmermann J (eds) Perspectives on operations research. DUV, Weisbaden, pp 293–317

    Google Scholar 

  • Klincewicz JG (1998) Hub location in backbone/tributary network design: a review. Loc Sci 6:307–335

    Article  Google Scholar 

  • Klincewicz JG (2002) Enumeration and search procedures for a hub location problem with economies of scale. Ann Oper Res 110:107–122

    Article  MathSciNet  MATH  Google Scholar 

  • Köksalan M, Soylu B (2010) Bicriteria p-hub location problems and evolutionary algorithms. INFORMS J Comput 22:528–542

    Article  MathSciNet  MATH  Google Scholar 

  • Labbé M, Yaman H (2004) Projecting the flow variables for hub location problems. Networks 44:84–93

    Article  MathSciNet  MATH  Google Scholar 

  • Labbé M, Yaman H (2008) Solving the hub location problem in a start-start network. Networks 51:19–33

    Article  MathSciNet  MATH  Google Scholar 

  • Labbé M, Yaman H, Gourdin É (2005) A branch and cut algorithm for hub location problems with single assignment. Math Program 102:371–405

    Article  MathSciNet  MATH  Google Scholar 

  • Laporte G (2009) Fifty years of vehicle routing. Trans Sci 43:408–416

    Article  Google Scholar 

  • Lee C-H, Ro H-B, Tcha D-W (1993) Topological design of a two-level network with ring-star configuration. Comput Oper Res 20:625–637

    Article  MATH  Google Scholar 

  • Liang H (2013) The hardness and approximation of the star p-hub center problem. Oper Res Lett 41:138–141

    Article  MathSciNet  MATH  Google Scholar 

  • Lin C-C, Lee S-C (2010) The competition game on hub network design. Transp Res B Methodol 44:618–629

    Article  Google Scholar 

  • Lowe TJ, Sim T (2013) The hub covering flow problem. J Oper Res Soc 64:973–981

    Article  Google Scholar 

  • Lüer-Villagra A, Marianov V (2013) A competitive hub location and pricing problem. Eur J Oper Res 231:734–744

    Article  MathSciNet  MATH  Google Scholar 

  • Lüer-Villagra A, Eiselt HA, Marianov V (2019) A single allocation p-hub median problem with general piecewise-linear costs in arcs. Comput Ind Eng 128:477–491

    Article  Google Scholar 

  • Mahmutogullari AI, Kara BY (2016) Hub location under competition. Eur J Oper Res 250:214–225

    Article  MathSciNet  MATH  Google Scholar 

  • Marianov V, Serra D (2003) Location models for airline hubs behaving as M/D/c queues. Comput Oper Res 30:983–1003

    Article  MATH  Google Scholar 

  • Marianov V, Serra D, ReVelle, CS (1999) Location of hubs in a competitive environment. Eur J Oper Res 114:363–371

    Article  MATH  Google Scholar 

  • Marín A (2005a) Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm. J Glob Optim 33:393–422

    Article  MathSciNet  MATH  Google Scholar 

  • Marín A (2005b) Formulating and solving splittable capacitated multiple allocation hub location problems. Comput Oper Res 32:3093–3109

    Article  MATH  Google Scholar 

  • Martins de Sá E, de Camargo RS, de Miranda R (2013) An improved Benders decomposition algorithm for the tree of hubs location problem. Eur J Oper Res 226:185–202

    Article  MathSciNet  MATH  Google Scholar 

  • Martins de Sá E, Contreras I, Cordeau J-F, de Camargo RS, de Miranda R (2015a) The hub line location problem. Transport Sci 9:500–518

    Article  Google Scholar 

  • Martins de Sá E, Contreras I, Cordeau J-F (2015b) Exact and heuristic algorithms for the design of hub networks with multiple lines. Eur J Oper Res 246:186–198

    Article  MathSciNet  MATH  Google Scholar 

  • Martins de Sá E, Morabito R, de Camargo RS (2018a) Benders decomposition applied to a robust multiple allocation incomplete hub location problem. Comput Oper Res 89:31–50

    Article  MathSciNet  MATH  Google Scholar 

  • Martins de Sá E, Morabito R, de Camargo RS (2018b) Efficient Benders decomposition algorithms for the robust multiple allocation incomplete hub location problem with service time requirements. Expert Syst Appl 93:50–61

    Article  MATH  Google Scholar 

  • Meier JF, Clausen U (2018) Solving single allocation hub location problems on Euclidean Data. Transport Sci 52:1141–1155

    Article  Google Scholar 

  • Meng Q, Wang X (2011) Intermodal hub-and-spoke network design: incorporating multiple stakeholders and multi-type containers. Transp Res B Methodol 45:724–742

    Article  Google Scholar 

  • Merakli M, Yaman H (2016) Robust intermodal hub location under polyhedral demand uncertainty. Transp Res B Methodol 86:66–85

    Article  Google Scholar 

  • Merakli M, Yaman H (2017) A capacitated hub location problem under hose demand uncertainty. Comput Oper Res 88:58–70

    Article  MathSciNet  MATH  Google Scholar 

  • Meyer T, Ernst AT, Krishnamoorthy M (2009) A 2-phase algorithm for solving the single allocation p-hub center problem. Comput Oper Res 36:3143–3151

    Article  MATH  Google Scholar 

  • Miranda G, de Camargo RS, O’Kelly ME, Campbell JF (2017) Formulations and decomposition methods for the incomplete hub location problem with and without hop-constraints. Appl Math Model 51:274–301

    Article  MathSciNet  MATH  Google Scholar 

  • Nagi G, Salhi S (1998) The many-to-many location-routing problem. Top 6:261–275

    Article  MathSciNet  MATH  Google Scholar 

  • O’Kelly ME (1986a) The location of interacting hub facilities. Transport Sci 20:92–106

    Article  Google Scholar 

  • O’Kelly ME (1986b) Activity levels at hub facilities in interacting networks. Geogr Anal 18:343–356

    Article  Google Scholar 

  • O’Kelly ME (1987) A quadratic integer program for the location of interacting hub facilities. Eur J Oper Res 32:393–404

    Article  MathSciNet  MATH  Google Scholar 

  • O’Kelly ME (1992) Hub facility location with fixed costs. Pap Reg Sci 20:293–306

    Article  Google Scholar 

  • O’Kelly ME (2012) Fuel burn and environmental implications of airline hub networks. Transport Res D 17:555–567

    Article  Google Scholar 

  • O’Kelly ME, Bryan DL (1998) Hub location with flow economies of scale. Transp Res B Methodol 32:605–616

    Article  Google Scholar 

  • O’Kelly ME, Miller HJ (1991) Solution strategies for the single facility minimax hub location problem. Pap Reg Sci 70:367–380

    Article  Google Scholar 

  • O’Kelly ME, Campbell JF, de Camargo RS, Miranda G (2015a) Multiple allocation hub location model with fixed arc costs. Geogr Anal 47:73–96

    Article  Google Scholar 

  • O’Kelly ME, Luna PL, de Camargo RS, Miranda G (2015b) Hub location problems with price sensitive demands. Netw Spat Econ 15:917–945

    Article  MathSciNet  MATH  Google Scholar 

  • O’Kelly ME, Miller HJ (1994) The hub network design problem: a review and synthesis. J Transp Geogr 2:31–40

    Article  Google Scholar 

  • Pirkul H, Schilling DA (1998) An efficient procedure for designing single allocation hub and spoke systems. Manage Sci 44:235–242

    Article  MATH  Google Scholar 

  • Puerto J, Ramos AB, Rodriguez-Chia AM (2011) Single-allocation ordered median hub location problems. Comput Oper Res 38:559–570

    Article  MathSciNet  MATH  Google Scholar 

  • Puerto J, Ramos AB, Rodriguez-Chia AM, Sanchez-Gil MC (2016) Ordered median hub location problems with capacity constraints. Transport Res C 70:142–156

    Article  Google Scholar 

  • Racunica I, Wynter L (2005) Optimal location of intermodal freight hubs. Transp Res B Methodol 39:453–477

    Article  Google Scholar 

  • Ramamoorthy P, Jayaswal S, Sinha A, Vidyarthi N (2018) Multiple allocation hub interdiction and protection problems: model formulations and solution approaches. Eur J Oper Res 270:230–245

    Article  MathSciNet  MATH  Google Scholar 

  • Rieck J, Ehrenberg C, Zimmermann J (2014) Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery. Eur J Oper Res 236:863–878

    Article  MathSciNet  MATH  Google Scholar 

  • Rodríguez-Martín I, Salazar-González JJ (2008) Solving a capacitated hub location problem. Eur J Oper Res 184:468–479

    Article  MathSciNet  MATH  Google Scholar 

  • Rodríguez-Martín I, Salazar-González JJ, Yaman H (2014) A branch-and-cut algorithm for the hub location and routing problem. Comput Oper Res 50:161–174.

    Article  MathSciNet  MATH  Google Scholar 

  • Rothenbcher A-K, Drexl M, Irnich S (2016) Branch-and-price-and-cut for a service network design and hub location problem, Eur J Oper Res 255:935–947

    Article  MathSciNet  MATH  Google Scholar 

  • Rostami B, Kämmerling N, Buchheim C, Clausen U (2018) Reliable single allocation hub location problem under hub breakdowns. Comput Oper Res 96:15–29

    Article  MathSciNet  MATH  Google Scholar 

  • Saberi M, Mahmassani HS (2013) Modeling the airline hub location and optimal market problems with continuous approximation techniques. J Transp Geogr 30:68–76

    Article  Google Scholar 

  • Saboury A, Ghaffari-Nasab N, Barzinpour F, Jabalameli MS (2013) Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks. Comput Oper Res 40:2493–2507

    Article  MathSciNet  MATH  Google Scholar 

  • Saito H, Fujie T, Matsui T, Matuura S (2009) A study of the quadratic semi-assignment polytope. Discret Optim 6:37–50

    Article  MathSciNet  MATH  Google Scholar 

  • Sasaki M (2005) Hub network design model in a competitive environment with flow threshold. J Oper Res Soc Jpn 48:158–171

    Article  MathSciNet  MATH  Google Scholar 

  • Sasaki M, Fukushima M (2001) Stackelberg hub location problem. J Oper Res Soc Jpn 44:390–405

    Article  MathSciNet  MATH  Google Scholar 

  • Sasaki M, Campbell JF, Ernst AT, Krishnamoorthy M (2009) Hub arc location with competition. Technical report NANZAN-TR-2009-02

    Google Scholar 

  • Serper EZ, Alumur SA (2016) The design of capacitated intermodal hub networks with different vehicle types. Transp Res B Methodol 86:51–65

    Article  Google Scholar 

  • Sim T, Lowe TJ, Thomas BW (2009) The stochastic p-hub center problem with service-level constraints. Comput Oper Res 36:3166–3177

    Article  MATH  Google Scholar 

  • Skorin-Kapov D (1998) Hub network games. Networks 31:293–302

    Article  MathSciNet  MATH  Google Scholar 

  • Skorin-Kapov D, Skorin-Kapov J, O’Kelly ME (1997) Tight linear programming relaxations of uncapacitated p-hub median problems. Eur J Oper Res 94:582–593

    Article  MATH  Google Scholar 

  • Sohn J, Park S (1997) A linear program for the two-hub location problem. Eur J Oper Res 100:617–622

    Article  MATH  Google Scholar 

  • Sohn J, Park S (2000) The single allocation problem in the interacting three-hub network. Networks 35:17–25

    Article  MathSciNet  MATH  Google Scholar 

  • Sung CS, Jin HW (2001) Dual-based approach for a hub network design problem under non-restrictive policy. Eur J Oper Res 132:88–105

    Article  MathSciNet  MATH  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

    Article  MathSciNet  MATH  Google Scholar 

  • Thomadsen T, Larsen J (2007) A hub location problem with fully interconnected backbone and access networks. Comput Oper Res 34:2520–2531

    Article  MATH  Google Scholar 

  • Tran TH, O’Hanley JR, Scaparra MP (2016) Reliable hub network design: formulation and solution techniques. Trans Sci 51:358–375

    Article  Google Scholar 

  • Wagner B (2008a) Model formulations for hub covering problems. J Oper Res Soc 59:932–938

    Article  MATH  Google Scholar 

  • Wagner B (2008b) A note on location of hubs in a competitive environment. Eur J Oper Res 184:57–62

    Article  MATH  Google Scholar 

  • Wieberneit N (2008) Service network design for freight transportation: a review. OR Spect 30:77–112

    Article  MathSciNet  MATH  Google Scholar 

  • Yaman H (2008) Star p-hub median problem with modular arc capacities. Comput Oper Res 35:3009–3019

    Article  MathSciNet  MATH  Google Scholar 

  • Yaman H, Carello G (2005) Solving the hub location problem with modular link capacities. Comput Oper Res 32:3227–3245

    Article  MATH  Google Scholar 

  • Yaman H, Kara BY, Tansel BÇ (2007) The latest arrival hub location problem for cargo delivery systems with stopovers. Transp Res B Methodol 41:906–919

    Article  Google Scholar 

  • Yoon MG, Current JR (2008) The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic. J Oper Res Soc 59:80–89

    Article  MATH  Google Scholar 

  • Zanjirani Farahani R, Hekmatfar M, Arabani AB, Nikbakhsh E (2013) Hub location problems: a review of models, classification, solution techniques, and applications. Comput Ind Eng 64:1096–1109

    Article  Google Scholar 

  • Zetina C, Contreras I, Cordeau J-F, Nikbakhsh E (2017) Robust uncapacitated hub location. Transp Res B Methodol 106:393–410

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Logistics and Transportation (CIRRELT), Concordia University and Interuniversity Research Centre on Enterprise Networks, Montreal, QC, Canada

    Ivan Contreras

  2. Department of Geography, The Ohio State University, Columbus, OH, USA

    Morton O’Kelly

Authors
  1. Ivan Contreras
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Morton O’Kelly
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ivan Contreras .

Editor information

Editors and Affiliations

  1. HEC Montréal, Montréal, QC, Canada

    Gilbert Laporte

  2. Institute for Operations Research, Karlsruhe Institute of Technology, Karlsruhe, Germany

    Stefan Nickel

  3. Faculty of Science, University of Lisbon, Lisbon, Portugal

    Francisco Saldanha da Gama

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Contreras, I., O’Kelly, M. (2019). Hub Location Problems. In: Laporte, G., Nickel, S., Saldanha da Gama, F. (eds) Location Science. Springer, Cham. https://doi.org/10.1007/978-3-030-32177-2_12

Download citation

Publish with us

Policies and ethics

Search

Navigation