Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 13, 2026

Available Issues

April 10, 2013 - May 13, 2026

The Hub Line Location Problem

Published Online:7 Apr 2015https://doi.org/10.1287/trsc.2014.0576

References

  • Adulyasak Y, Cordeau J-F, Jans R (2012) Benders decomposition for production routing under demand uncertainty. GERAD Technical Report G-2012-57, HEC Montréal, Montréal.Google Scholar
  • Alumur S, 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
  • Applegate D, Bixby R, Chvátal V, Cook W (2012) Concorde TSP solver. Accessed March 4, 2015. http://www.tsp.gatech.edu/concorde.html.Google Scholar
  • Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4(1):238–252.Crossref, Google Scholar
  • Birge JR, Louveaux FV (1988) A multicut algorithm for two-stage stochastic linear programs. Eur. J. Oper. Res. 34(3):384–392.Crossref, Google Scholar
  • Bruno G, Ghiani G, Improta G (1998) A multi-modal approach to the location of a rapid transit line. Eur. J. Oper. Res. 104(2):321–332.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, 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 on 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
  • Church RL, ReVelle CS (1976) Theoretical and computational links between the p-median, location set-covering, and the maximal covering location problem. Geographical Anal. 8(4):406–415.Crossref, Google Scholar
  • Codato G, Fischetti M (2006) Combinatorial Benders’ cuts for mixed-integer linear programming. Oper. Res. 54(4):756–766.Link, 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(3):680–697.Crossref, Google Scholar
  • Contreras I, Fernández E (2014) Hub location as the minimization of a supermodular set function. Oper. Res. 62(3):557–570.Link, Google Scholar
  • Contreras I, Fernández E, Marín A (2009) Tight bounds from a path based formulation for the tree of hub location problem. Comput. Oper. Res. 36(12):3117–3127.Crossref, Google Scholar
  • Contreras I, Tanash M, Vidyarthi N (2015) A branch and cut algorithm for the cycle hub location problem. Ann. Oper. Res. Forthcoming.Google Scholar
  • Current JR, Revelle CS, Cohon JL (1987) The median shortest path problem: A multiobjective approach to analyze cost vs. accessibility in the design of transportation networks. Transportation Sci. 21(3):188–197.Link, Google Scholar
  • Dufourd H, Gendreau M, Laporte G (1996) Locating a transit line using tabu search. Location Sci. 4(1):1–19.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.Crossref, 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(4):1096–1109.Crossref, Google Scholar
  • Fischetti M, Monaci M (2014) Exploiting erraticism in search. Oper. Res. 62(1):114–122.Link, Google Scholar
  • Fortz B, Poss M (2009) An improved Benders decomposition applied to a multi-layer network design problem. Oper. Res. Lett. 37(5):359–364.Crossref, Google Scholar
  • Gelareh S, Nickel S (2011) Hub location problems in transportation networks. Transportation Res. Part E: Logist. Transportation Rev. 47(6):1092–1111.Crossref, Google Scholar
  • Geoffrion GM, Graves GW (1974) Multicommodity distribution system design by Benders decomposition. Management Sci. 20(5):822–844.Link, Google Scholar
  • Hakimi SL, Schmeichel EF, Labbé M (1993) On locating path- or tree-shaped facilities on networks. Networks 23(6):543–555.Crossref, Google Scholar
  • Labbé M, Yaman H (2008) Solving the hub location problem in a star-star network. Networks 51(1):19–33.Crossref, Google Scholar
  • Labbé M, Laporte G, Rodríguez-Martín I (1998) Path, tree and cycle location. Crainic TG, Laporte G, eds. Fleet Management and Logistics (Kluwer Academic, Boston), 187–204.Crossref, Google Scholar
  • Laporte G, Mesa JA, Ortega FA (2002) Locating stations on rapid transit lines. Comput. Oper. Res. 29(6):741–759.Crossref, Google Scholar
  • Lari I, Ricca F, Scozzari A (2008) Comparing different metaheuristic approaches for the median path problem with bounded length. Eur. J. Oper. Res. 190(3):587–597.Crossref, 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(6):625–637.Crossref, Google Scholar
  • Magnanti TL, Wong RT (1981) Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Oper. Res. 29(3):464–483.Link, Google Scholar
  • Martin RK (1999) Large Scale Linear and Integer Optimization—A Unified Approach (Kluwer Academic, Boston).Crossref, Google Scholar
  • Martins de Sá E, 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
  • McDaniel D, Devine M (1977) A modified Benders partitioning algorithm for mixed integer programming. Management Sci. 24(3):312–319.Link, Google Scholar
  • Mesa JA, Boffey BT (1996) A review of extensive facility location in networks. Eur. J. Oper. Res. 95(3):592–603.Crossref, Google Scholar
  • Naoum-Sawaya J, Elhedhli S (2013) An interior-point Benders based branch-and-cut algorithm for mixed integer programs. Ann. Oper. Res. 210(1):33–55.Crossref, Google Scholar
  • Nickel S, Schöbel A, Sonneborn T (2001) Hub location problems in urban traffic networks. Pursula M, Niittymäki J, eds. Mathematical Methods on Optimisation in Transportation Systems (Springer, New York), 95–107.Crossref, 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, Miller HJ (1994) The hub network design problem: A review and synthesis. J. Transport Geography 2(1):31–40.Crossref, Google Scholar
  • Rei W, Cordeau J-F, Gendreau M, Soriano P (2009) Accelerating Benders decomposition by local branching. INFORMS J. Comput. 21(2):333–345.Link, Google Scholar
  • Slater PJ (1982) Locating central paths in a graph. Transportation Sci. 16(1):1–18.Link, 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 (2009) The hierarchical hub median problem with single assignment. Transportation Res. Part B: Methodological 43(6):643–658.Crossref, Google Scholar
Previous
Back to Top
Next
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.
Agree