Hub Location Problem

Part of the Contributions to Management Science book series (MANAGEMENT SC.)


One of the novel topics in location problems is the hub location problem. There are plenty of applications for the hub location problem; therefore, this section is dedicated to introducing this problem to readers. The preface is composed of three parts: apprehensions, definitions, and classifications of the hub location problem. In this chapter we discuss services such as, movement of people, commodities and information which occurs between an origin-destination pair of nodes (see A–B in Fig. 11.1 as an origin-destination pair). Each origin-destination pair needs a service different from other pairs. Thus, the commodities carried from i to j are not interchangeable with the commodities carried from j to i.


Location Problem Tabu Search Fixed Cost Candidate Node Demand Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Abdinnour-Helm S (1998) A hybrid heuristic for the uncapacitated hub location problem. Eur J Oper Res 106:489–99CrossRefGoogle Scholar
  2. Abdinnour-Helm S, Venkataramanan MA (1998) Solution approaches to hub location problems. Ann Oper Res 78:31–50CrossRefGoogle Scholar
  3. Adler N, Hashai N (2005) Effect of open skies in the Middle East region. Transport Res 39:878–894CrossRefGoogle Scholar
  4. Aversa R, Botter RC, Haralambides HE, Yoshizaki HTY (2005)A mixed integer programming model on the location of a hub port in the East Coast of South America. Maritime Econ Logist 7:1–18CrossRefGoogle Scholar
  5. Aykin T (1994) Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem. Eur J Oper Res 79:501–523CrossRefGoogle Scholar
  6. Aykin T (1995) Networking policies for hub-and-spoke systems with application to the air transportation system. Transport Sci 29(3):201–221CrossRefGoogle Scholar
  7. Baird AJ (2006) Optimizing the Container transshipment hub location in northern Europe. J Transport Geograph 14(3):195–214CrossRefGoogle Scholar
  8. Bania N, Bauer P, Zlatoper TU (1998) Air passenger service: A taxonomy of route network, hub location, and competition. Logist Transport Rev 34:53–74CrossRefGoogle Scholar
  9. Berman O, Drezner Z, Wesolowsky G (2007) The transfer point location problem. Eur J Oper Res 179(3):978–989CrossRefGoogle Scholar
  10. Bollapragada R, Camm J, Rao US, Wu J (2005) A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broad bound access. Oper Res Lett 33:134–142CrossRefGoogle Scholar
  11. Camargo RS, Miranda Jr G, Luna HP (2008) Benders decomposition for the uncapacitated multiple allocation hub location problem. Comput Oper Res 35(4):1047–1064CrossRefGoogle Scholar
  12. Campbell JF (1991) Hub location problems and the p-hub median problem. Center for Business and Industrial Studies, University of Missouri, St. Louis, MOGoogle Scholar
  13. Campbell JF (1994) Integer programming formulations of discrete hub location problems. Eur J Oper Res 72:387–405CrossRefGoogle Scholar
  14. Campbell JF (1996) Hub location and P-hub median problem. Oper Res 44(6):923–935CrossRefGoogle Scholar
  15. Campbell JF, Ernst A, Krishnamoorthy M (2002) Hub location problems. In: Drezner Z, Hammacher H (eds) Facility location: applications and theory. Berlin, SpringerGoogle Scholar
  16. Campbell AM, Lowe TJ, Zhang L (2007) The P-hub center allocation problem. Eur J Oper Res 176(2):819–835CrossRefGoogle Scholar
  17. Canovas L, Garcia S, Marin A (2007) Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique. Eur J Oper Res 179:990–1007CrossRefGoogle Scholar
  18. Chen JF (2007) A hybrid heuristic for the uncapacitated single allocation hub location problem. Omega 35(2):211–220CrossRefGoogle Scholar
  19. Costa MG, Captivo ME, Climaco J (2008) Capacitated single allocation hub location problem-A bi-criteria approach. Comput Oper Res 35(11):3671–3695Google Scholar
  20. 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–758CrossRefGoogle Scholar
  21. Daskin MS (1995) Network and discrete location: Models, algorithms, and applications. Wiley, New YorkCrossRefGoogle Scholar
  22. Don T, Harit S, English JR, Whicker G (1995) Hub and spoke networks in truckload trucking: configuration testing and operational concerns. Logist Transport 31:209–237Google Scholar
  23. Ebery J (2001) Solving large single allocation p-hub problems with two or three hubs: Eur J Oper Res 128:447–458Google Scholar
  24. Ebery J, Krishnamoorty M, Ernst A, Boland N (2000) The capacitated multiple allocation hub location problem: formulation and algorithms. Eur J Oper Res 120:614–631CrossRefGoogle Scholar
  25. Eiselt HA (2007) Locating landfills – optimization vs. reality. Eur J Oper Res 179(3): 1040–1049Google Scholar
  26. Ernst A, Krishnamoorthy M (1996) Efficient algorithms for the uncapaciterted single allocation P-hub median problem. Location Sci 4:139–154CrossRefGoogle Scholar
  27. Ernst A, Krishnamoorthy M (1999) Solution algorithms for the capacitated Single allocation hub location problem. Ann Oper Res 86:141–159CrossRefGoogle Scholar
  28. Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading, MAGoogle Scholar
  29. Hakimi SL (1964) Optimum location of switching centers and the absolute centers and medians of a graph. Oper Res 12:450–459CrossRefGoogle Scholar
  30. Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, MichiganGoogle Scholar
  31. Jaillet P, Song G, Yu G (1996) Airline network design and hub location problems. Location Sci 4(3):195–212CrossRefGoogle Scholar
  32. Klincewicz JG (1991) Heuristics for the P-hub location problem. Eur J Oper Res 53:25–37CrossRefGoogle Scholar
  33. Klincewicz JG (1992) Avoiding local optima in the P-hub location problem using tabu search and grasp. Ann Oper Res 40:283–302CrossRefGoogle Scholar
  34. Klincewicz JG (1996) A dual algorithm for the uncapacitated hub location problem. Location Sci 4(3):173–184CrossRefGoogle Scholar
  35. Klincewicz JG (1998) Hub location in backbone tributary network design: A review. Location Sci 6:307–335CrossRefGoogle Scholar
  36. Kratica J, Stanimirovic Z, Tosic D, Filipovic V (2007) Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem. Eur J Oper Res 182:15–28CrossRefGoogle Scholar
  37. Krishnamoorthy M, Mills G, Sier D (1994) Strategic configuration of the mail processing network: location–allocation modeling-stage 1, CSIRO, Technical Report DMS-C94/9 Division of Mathematics and statistics CSIRO, AustraliaGoogle Scholar
  38. Kuby MJ, Gray RG (1993) Hub network design problem with stoppers and feeders: Case of federal express. Transport Res 27:1–12CrossRefGoogle Scholar
  39. Labbe M, Yaman H, Gourdin E (2005) A branch and cut algorithm for hub location problems with single assignment 102:371–405Google Scholar
  40. Lee Y, Lim B, Park J (1996) A hub location problem in designing digital data service networks: Lagrangian relaxation approach. Location Sci 4:183–194CrossRefGoogle Scholar
  41. Lumsdenk, Dallari F, Ruggeri R (1999) Improving the efficiency of the hub and spoke system for the SKF European distribution network. Int J Phys Distrib Logist Manage 29:50–64CrossRefGoogle Scholar
  42. Marianov V, Serra D (2003) Location models for airline hubs behaving as M/D/c queues. Comput Oper Res 30:983–1003CrossRefGoogle Scholar
  43. Marin A (2005) Formulating and solving splittable capacitated multiple allocation hub location problems. Comput Oper Res 32:3093–3109CrossRefGoogle Scholar
  44. Martin JC, Roman C (2003) Hub location in the South-Atlantic airline market: A spatial competition game. Transport Res A: Policy Pract 37(10):865–888CrossRefGoogle Scholar
  45. Mayer G, Wagner B (2002) Hub Locator: an exact solution method for the multiple allocation hub location problem. Comput Oper Res 29:715–39CrossRefGoogle Scholar
  46. Mitchell M (1998) An introduction to genetic algorithms. MIT Press, Cambridge, MAGoogle Scholar
  47. O’Kelly ME (1986) The location of interacting hub facilities, Transport Sci 20:92–106CrossRefGoogle Scholar
  48. O’Kelly ME (1987) A quadratic integer program for the location of interacting hub facilities. Eur J Oper Res 32:393–404CrossRefGoogle Scholar
  49. O’ Kelly ME (1992) Hub facility location with fixed costs. Papers in Regional Science 71:292–306Google Scholar
  50. Ostresh LMJr (1975) An efficient algorithm for solving the two center location – allocation problem. J Region Sci 15:209–216CrossRefGoogle Scholar
  51. Pamuk FS, Sepil C (2001) A solution to the hub center problem via a single-relocation algorithm with Tabu search. IIE Trans 33:399–411Google Scholar
  52. Pirkul H, Schilling DA (1998) An efficient procedure for designing single allocation hub and spoke systems. Manage Sci 44(12):235–242CrossRefGoogle Scholar
  53. Rodriguez V, Alvarez MJ, Barcos L (2007) Hub location under capacity constraints. Transport Res Part E: Logist Transport Rev 43:495–505CrossRefGoogle Scholar
  54. Rodriguez-Martin I, Salazar-Gonzalez JJ (2008) Solving a capacitated hub location problem. Eur J Oper Res 184(2):468–479CrossRefGoogle Scholar
  55. Sasaki M, Suzuki A, Drezner Z (1999) On the selection of hub airports for an airline hub-and-spoke system. Comput Oper Res 26:1411–1422CrossRefGoogle Scholar
  56. Shaw SL (1993) Hub structures of major US passenger airline. J Transport Geograph 1(1):47–58CrossRefGoogle Scholar
  57. Skorin-Kapov D, Skorin-Kapov J (1994) On Tabu search for the location of interacting hub facilities, Eur J Oper Res 73:502–509CrossRefGoogle Scholar
  58. Skorin-Kapov D, Skorin-Kapov J, O’Kelly M (1996) Tight linear programming relaxations of uncapacitated p-hub median problems. Proc Natl Decis Sci Conf, Boston 94:582–593Google Scholar
  59. Sohn J, Park S (1998) Efficient solution procedure and reduced size formulation for P-hub location problem. Eur J Oper Res 108:118–126CrossRefGoogle Scholar
  60. Sung CS, Jin HW (2001) Dual-based approach for a hub network design problem under non-restrictive policy. Eur J Oper Res 132:88–105CrossRefGoogle Scholar
  61. Thomadsen T, Larsen J (2007) A hub location problem with fully interconnected backbone and access networks. Comput Oper Res 34:2520–2531CrossRefGoogle Scholar
  62. Toh RS, Higgins RC (1985) The impact of hub and spoke network centralization and route monopoly on domestic airline profitability. Transport J 24:16–27Google Scholar
  63. Topcuoglu H, Corut F, Ermis M, Yilmaz G (2005) Solving the uncapacitated hub location using genetic algorithms. Comput Oper Res 32:467–984CrossRefGoogle Scholar
  64. Wagner B (2007) An exact solution procedure for a cluster hub location problem, Eur J Oper Res 178:391–401CrossRefGoogle Scholar
  65. Wagner B (2008) A note on location of hubs in a competitive environment. Eur J Oper Res 184(1):57–62CrossRefGoogle Scholar
  66. Yaman H (2008) Star P-hub median problem with modular arc capacities. Comput Oper Res 35(9):3009–3019CrossRefGoogle Scholar
  67. Yaman H, Kara BY, Tansel BC (2007) The latest arrival hub location problem for cargo delivery systems with stopovers. Transport Res B 41:906–919CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  1. 1.Department of Industrial EngineeringAmirkabir University of TechnologyTehranIran
  2. 2.Department of Industrial Engineering, Faculty of EngineeringUniversity of TehranTehranIran

Personalised recommendations