Hub location problems generally assume that the triangle inequality applies on the edges of a complete graph. Hence the flow between any pair of nodes requires at most two hubs for the transfer process. Here we relax the triangle inequality restriction and present two new formulations of the uncapacitated multiple allocation p-hub median problem that allow transfer through more than two hubs. Some testing is performed on newly generated instances where the triangle inequality does not hold in order to assess the tractability of these new mathematical models, and their usefulness compared to the standard approach.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)
Alumur, S., Kara, B.Y.: Network hub location problems: the state of the art. Eur. J. Oper. Res. 190(1), 1–21 (2008)
Alumur, S.A., Kara, B.Y., Karasan, O.E.: The design of single allocation incomplete hub networks. Transp. Res. Part B: Methodol. 43(10), 936–951 (2009)
Boland, N., Krishnamoorthy, M., Ernst, A.T., Ebery, J.: Preprocessing and cutting for multiple allocation hub location problems. Eur. J. Oper. Res. 155(3), 638–653 (2004)
Brimberg, J., Mladenović, N., Todosijević, R., Urošević, D.: A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem. Optim. Lett. (2015). https://doi.org/10.1007/s11590-015-0973-5
Brimberg, J., Mladenović, N., Todosijević, R., Urošević, D.: General variable neighborhood search for the uncapacitated single allocation p-hub center problem. Optim. Lett. 11, 377–388 (2015). https://doi.org/10.1007/s11590-016-1004-x
Campbell, J.F.: Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72(2), 387–405 (1994)
Cánovas, L., García, S., Marín, A.: Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique. Eur. J. Oper. Res. 179(3), 990–1007 (2007)
Contreras, I., Fernández, E., Marín, A.: The tree of hubs location problem. Eur. J. Oper. Res. 202(2), 390–400 (2010)
de Camargo, R.S., Miranda Jr., G., Luna, H.P.: Benders decomposition for the uncapacitated multiple allocation hub location problem. Comput. Oper. Res. 35(4), 1047–1064 (2008)
Ernst, A.T., Hamacher, H., Jiang, H., Krishnamoorthy, M., Woeginger, G.: Uncapacitated single and multiple allocation p-hub center problems. Comput. Oper. Res. 36(7), 2230–2241 (2009)
Ernst, A.T., Jiang, H., Krishnamoorthy, M., Baatar, H.: Reformulations and computational results for uncapacitated single and multiple allocation hub covering problems. Work. Pap. Ser. 1, 1–18 (2011)
Ernst, A.T., Krishnamoorthy, M.: Efficient algorithms for the uncapacitated single allocation p-hub median problem. Locat. Sci. 4(3), 139–154 (1996)
Ernst, A.T., Krishnamoorthy, M.: Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. Eur. J. Oper. Res. 104(1), 100–112 (1998)
Farahani, R.Z., Hekmatfar, M., Arabani, A.B., Nikbakhsh, E.: Hub location problems: a review of models, classification, solution techniques, and applications. Comput. Ind. Eng. 64(4), 1096–1109 (2013)
García, S., Landete, M., Marín, A.: New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem. Eur. J. Oper. Res. 220(1), 48–57 (2012)
Gavriliouk, E.O.: Aggregation in hub location problems. Comput. Oper. Res. 36(12), 3136–3142 (2009)
Gelareh, S., Nickel, S.: Hub location problems in transportation networks. Transp. Res. Part E: Logist. Transp. Rev. 47(6), 1092–1111 (2011)
Hamacher, H.W., Labbé, M., Nickel, S., Sonneborn, T.: Adapting polyhedral properties from facility to hub location problems. Discrete Appl. Math. 145(1), 104–116 (2004)
Hwang, Y.H., Lee, Y.H.: Uncapacitated single allocation p-hub maximal covering problem. Comput. Ind. Eng. 63(2), 382–389 (2012)
Ilić, A., Urošević, D., Brimberg, J., Mladenović, N.: A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. Eur. J. Oper. Res. 206(2), 289–300 (2010)
Marın, A., Cánovas, L., Landete, M.: New formulations for the uncapacitated multiple allocation hub location problem. Eur. J. Oper. Res. 172(1), 274–292 (2006)
Martí, R., Corberán, Á., Peiró, J.: Scatter search for an uncapacitated p-hub median problem. Comput. Oper. Res. 58, 53–66 (2015)
Meyer, T., Ernst, A.T., Krishnamoorthy, M.: A 2-phase algorithm for solving the single allocation p-hub center problem. Comput. Oper. Res. 36(12), 3143–3151 (2009)
Peiró, J., Corberán, A., Martí, R.: Grasp for the uncapacitated r-allocation p-hub median problem. Comput. Oper. Res. 43(1), 50–60 (2014)
Peker, M., Kara, B.Y.: The p-hub maximal covering problem and extensions for gradual decay functions. Omega 54, 158–172 (2015)
Skorin-Kapov, D., Skorin-Kapov, J., O’Kelly, M.: Tight linear programming relaxations of uncapacitated p-hub median problems. Eur. J. Oper. Res. 94(3), 582–593 (1996)
Todosijević, R., Urošević, D., Mladenović, N., Hanafi, S.: A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem. Optim. Lett. (2015). https://doi.org/10.1007/s11590-015-0867-6
Weng, K., Yang, C., Ma, Y.: Two artificial intelligence heuristics in solving multiple allocation hub maximal covering problem. In: Intelligent computing, pp. 737–744 (2006)
Yaman, H.: Allocation strategies in hub networks. Eur. J. Oper. Res. 211(3), 442–451 (2011)
Yoon, M.-G., Current, J.: The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic. J. Oper. Res. Soc. 59(1), 80–89 (2008)
This research is partially supported by Serbian Ministry of Education, Science and Technological Development under the grants nos. 174010 and 044006. In addition, this research is partially covered by the framework of the Grant Number BR05236839 “Development of information technologies and systems for stimulation of personality’s sustainable development as one of the bases of development of digital Kazakhstan”.
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
About this article
Cite this article
Brimberg, J., Mladenović, N., Todosijević, R. et al. A non-triangular hub location problem. Optim Lett 14, 1107–1126 (2020). https://doi.org/10.1007/s11590-019-01392-2
- Hub location
- Multiple allocation
- p-Hub median
- Triangle inequality