Solving Single Allocation Hub Location Problems on Euclidean Data

References

• 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, Kara BY, Karasan OE (2012a) Multimodal hub location and hub network design. Omega 40(6):927–939.Crossref, Google Scholar
• Alumur SA, Yaman H, Kara BY (2012b) Hierarchical multimodal hub location problem with time-definite deliveries. Transportation Res. Part E: Logist. Transportation Rev. 48(6):1107–1120.Crossref, Google Scholar
• Bailey A, Ornbuki-Berrnan B, Asobiela S (2013) Discrete PSO for the uncapacitated single allocation hub location problem. IEEE Workshop Comput. Intelligence Production Logist. Systems (CIPLS), 92–98.Crossref, Google Scholar
• Baumung MN, Gündüz HI (2015) Consolidation of residual volumes in a parcel service provider’s long-haul transportation network. Corman F, Voss S, Negenborn R, eds. Computational Logistics, Lecture Notes Comput. Sci., Vol. 9335 (Springer International Publishing, Cham, Switzerland), 437–450.Crossref, Google Scholar
• Beasley JE (2012) OR library. http://people.brunel.ac.uk/~mastjjb/jeb/orlib/phubinfo.html.Google Scholar
• Bryan D (1998) Extensions to the hub location problem: Formulations and numerical examples. Geographical Anal. 30(4):315–330.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
• 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, Cordeau J-F, 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, Díaz JA, Fernández E (2009) 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 (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):1047–1066.Crossref, 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(3):747–758.Crossref, 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, Luna HPL (2009) Benders decomposition for hub location problems with economies of scale. Transportation Sci. 43(1):86–97.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 (1999) Solution algorithms for the capacitated single allocation hub location problem. Ann. Oper. Res. 86:141–159.Crossref, Google Scholar
• Gelareh S (2008) Hub location models in public transport planning. Unpublished doctoral thesis, Technical University of Kaiserslautern, Kaiserslautern, Germany.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
• Gelareh S, Pisinger D (2011) Fleet deployment, network design and hub location of liner shipping companies. Transportation Res. Part E: Logist. Transportation Rev. 47(6):947–964.Crossref, 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
• Kim H, O’Kelly ME (2009) Reliable p-hub location problems in telecommunication networks. Geographical Anal. 41(3):283–306.Crossref, Google Scholar
• Kratica J, Stanimirović Z, Tošić D, Filipović V (2007) Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem. Eur. J. Oper. Res. 182(1):15–28.Crossref, Google Scholar
• Lin C-C, Lin J-Y, Chen Y-C (2012) The capacitated p-hub median problem with integral constraints: An application to a Chinese air cargo network. Appl. Math. Model. 36(6):2777–2787.Crossref, Google Scholar
• Meier JF (2017) An improved mixed integer program for single allocation hub location problems with stepwise cost function. Internat. Trans. Oper. Res. 24(5):983–991.Crossref, Google Scholar
• Meier JF, Clausen U (2015) Solving the probabilistic traveling salesman problem by linearising a quadratic approximation. Optimization Online Forthcoming.Google Scholar
• Meier JF, Clausen U, Rostami B, Buchheim C (2016) A compact linearisation of Euclidean single allocation hub location problems. Electronic Notes Discrete Math. 52:37–44.Crossref, 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 (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 (1992) Hub facility location with fixed costs. Papers Regional Sci. 71(3):293–306.Crossref, Google Scholar
• Silva MR, Cunha CB (2009) New simple and efficient heuristics for the uncapacitated single allocation hub location problem. Comput. Oper. Res. 36(12):3152–3165.Crossref, Google Scholar
• Skorin-Kapov D, Skorin-Kapov J, O’Kelly M (1996) Tight linear programming relaxations of uncapacitated p-hub median problems. Eur. J. Oper. Res. 94(3):582–593.Crossref, Google Scholar
• Stanek R (2016) Problems on tours and trees in combinatorial optimization. Unpublished doctoral thesis, University of Graz, Graz, Austria.Google Scholar
• Stanimirović Z (2012) A genetic algorithm approach for the capacitated single allocation p-hub median problem. Comput. Informatics 29(1):117–132.Google Scholar
• Stanojević P, Marić M (2015) Solving large scale instances of hub location problems with a sub-problem using an exact method. IPSI BgD Trans. Internet Res. 11(1):1–6.Google Scholar
• Topcuoglu H, Corut F, Ermis M, Yilmaz G (2005) Solving the uncapacitated hub location problem using genetic algorithms. Comput. Oper. Res. 32(4):967–984.Crossref, Google Scholar