Abstract
This article considers the capacitated hub location problem with single assignment. We propose a Lagrangean relaxation to obtain tight upper and lower bounds. The Lagrangean function that we formulate exploits the structure of the problem and can be decomposed into smaller subproblems that can be solved efficiently. In addition, we present some simple reduction tests, based on the Lagrangean relaxation bounds that allows us to reduce considerably the size of the formulation and thus, to reduce the computational effort. Computational experiments have been performed with both benchmark instances from literature and with some new larger instances. The obtained results are impressive. For all tested instances (ranging from 10 to 200 nodes), we obtain or improve the best known solution and the obtained duality gaps, between our upper and lower bounds, never exceed 3.4%.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alumur S, Kara B (2008) Network hub location problems: the state of the art. Eur J Oper Res 190(1): 1–21
Aykin T (1994) Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem. Eur J Oper Res 79: 501–523
Aykin T (1995) Networking policies for hub-and-spoke systems with applications to the air transportation system. Transport Sci 3: 201–221
Boland N, Ernst A, Krishnamoorthy M, Ebery J (2004) Preprocessing and cutting methods for multiple allocation hub location problems. Eur J Oper Res 155(3): 638–653
Campbell J, Ernst A, Krishnamoorthy M (2002) Hub location problems. In: Hamacher H, Drezner Z (eds) Facility location: applications and theory. Springer, Berlin, pp 373–407
Campbell JF (1994) Integer programming formulations of discrete hub location problems. Eur J Oper Res 72: 387–405
Campbell JF, Ernst AT, Krishnamoorthy M (2005a) Hub arc location problems: Part i—introduction and results. Manag Sci 51(10): 1540–1555
Campbell JF, Ernst AT, Krishnamoorthy M (2005b) Hub arc location problems: Part ii—formulations and optimal algorithms. Manag Sci 51(10): 1556–1571
Costa M, Captivo M, Climaco J (2008) Capacitated sinlge allocation hub location problem—a bi-criteria approach. Comput Oper Res 35(11): 3671–3695
Ebery J, Krishnamoorthy M, Ernst AT, Boland N (2000) The capacitated multiple allocation hub location problem: formulations and algorithms. Eur J Oper Res 120(3): 614–631
Ernst A, Krishnamoorthy M (1996) Efficient algorithms for the uncapacitated single allocation p-hub median problem. Locat Sci 4(3): 139–154
Ernst A, Krishnamoorthy M (1999) Solution algorithms for the capacitated single allocation hub location problem. Ann Oper Res 86: 141–159
Guignard M (2003) Lagrangean relaxation. TOP 11: 151–228
Labbé M, Yaman H, Gourdin E (2005) A branch and cut algorithm for hub location problems with single assignment. Math Progr 102(2): 371–405
Marín A (2005) Formulating and solving splittable capacitated multiple allocation hub location problems. Comput Oper Res 32: 3093–3109
Martello S, D DP, Toth P (2000) New trends in exact algorithms for the 0-1 knapsack problem. Eur J Oper Res 123: 325–332
O’Kelly M (1986) Activity levels at hub facilities in interacting networks. Geogr Anal 18(4): 343–356
O’Kelly M (1987) A quadratic integer program for the location of interacting hub facilities. Eur J Oper Res 32: 393–404
O’Kelly ME, Bryan D (2002) Interfacility interaction in models of hub and spoke networks. J Reg Sci 42(1): 145–164
Pirkul H, Schilling D (1998) An efficient procedure for designing single allocation hub and spoke systems. Manag Sci 44(12): 235–242
Podnar H, Skorin-Kapov J, Skorin-Kapov D (2002) Network cost minimization using threshold-based dicounting. Eur J Oper Res 137: 371–386
Rodríguez-Martín I, Salazar-González JJ (2008) Solving a capacitated hub location problem. Eur J Oper Res 184: 468–479
Sasaki M, Fukushima M (2003) On the hub-and-spoke model with arc capacities constraints. J Oper Res Soc Jpn 46(4): 409–428
Skorin-Kapov D, Skorin-Kapov J, O’Kelly M (1996) Tight linear programming relaxations of uncapacitated p-hub median problems. Eur J Oper Res 73: 501–508
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Contreras, I., Díaz, J.A. & Fernández, E. Lagrangean relaxation for the capacitated hub location problem with single assignment. OR Spectrum 31, 483–505 (2009). https://doi.org/10.1007/s00291-008-0159-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-008-0159-y