Abstract
We consider the well-known uncapacitated p-hub median problem with multiple allocation (UMApHMP), and single allocation (USApHMP). These problems have received significant attention in the literature because while they are easy to state and understand, they are hard to solve. They also find practical applications in logistics and telecommunication network design. Due to the inherent complexity of these problems, we apply a modified Benders decomposition method to solve large instances of the UMApHMP and USApHMP. The Benders decomposition approach does, however, suffer from slow convergence mainly due to the high degeneracy of subproblems. To resolve this, we apply a novel method of accelerating Benders method. We improve the performance of the accelerated Benders method by more appropriately choosing parameters for generating cuts, and by solving subproblems more efficiently using minimum cost network flow algorithms. We implement our approach on well-known benchmark data sets in the literature and compare our computational results for our implementations of existing methods and commercial solvers. The computational results confirms that our approach is efficient and enables us to solve larger single- and multiple allocation hub median instances. We believe this paper is the first implementation of Benders method to solve USA\(p\)HMP and UMA\(p\)HMP.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numer. Math., 4(1), 238–252.
Campbell, J. F. (1994). Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res., 72(2), 387–405.
Campbell, J. F. (1996). Hub location and the p-hub median problem. Oper. Res., 44(6), 923–935.
Campbell, J. F., & O’Kelly, M. E. (2012). Twenty-five years of hub location research. Transp. Sci., 46(2), 153–169.
Contreras, I., Cordeau, J.-F., & Laporte, G. (2011). Benders decomposition for large-scale uncapacitated hub location. Oper. Res., 59(6), 1477–1490.
de Camargo, R. S., Miranda, Gd, & Luna, H. (2008). Benders decomposition for the uncapacitated multiple allocation hub location problem. Comput. Oper. Res., 35(4), 1047–1064.
Ernst, A. T., & Krishnamoorthy, M. (1996). Efficient algorithms for the uncapacitated single allocation p-hub median problem. Locat. Sci., 4(3), 139–154.
Ernst, A. T., & Krishnamoorthy, M. (1998a). An exact solution approach based on shortest-paths for p-hub median problems. INFORMS J. Comput., 10(2), 149–162.
Ernst, A. T., & Krishnamoorthy, M. (1998b). Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. Eur. J. Oper. Res., 104(1), 100–112.
Love, R. F., Morris, J. G., & Wesolowsky, G. O. (1988). Facilities location.
Magnanti, T. L., & Wong, R. T. (1981). Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Oper. Res., 29(3), 464–484.
O’Kelly, M. E. (1986). The location of interacting hub facilities. Transp. Sci., 20(2), 92–106.
O’Kelly, M. E. (1987). A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res., 32(3), 393–404.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Mokhtar, H., Krishnamoorthy, M., Ernst, A.T. (2018). A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems. In: Kliewer, N., Ehmke, J., Borndörfer, R. (eds) Operations Research Proceedings 2017. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-89920-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-89920-6_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-89919-0
Online ISBN: 978-3-319-89920-6
eBook Packages: Business and ManagementBusiness and Management (R0)