A non-triangular hub location problem
- 15 Downloads
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.
KeywordsHub location Multiple allocation p-Hub median Triangle inequality
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”.
- 3.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)Google Scholar
- 5.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
- 12.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)Google Scholar
- 15.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)Google Scholar
- 18.Gelareh, S., Nickel, S.: Hub location problems in transportation networks. Transp. Res. Part E: Logist. Transp. Rev. 47(6), 1092–1111 (2011)Google Scholar
- 20.Hwang, Y.H., Lee, Y.H.: Uncapacitated single allocation p-hub maximal covering problem. Comput. Ind. Eng. 63(2), 382–389 (2012)Google Scholar
- 26.Peker, M., Kara, B.Y.: The p-hub maximal covering problem and extensions for gradual decay functions. Omega 54, 158–172 (2015)Google Scholar
- 28.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
- 29.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)Google Scholar