Abstract
In this paper, an adjustable robust optimization with a polyhedral uncertainty set is used to deal with uncertain transportation cost in an uncapacitated multiple allocation balanced hub location problem. Adjustable robust optimization is modeled as two-stage or multi-stage problems in which decisions are determined in two or multi-separated stages. In two-stage robust optimization, first, the location of hubs is determined in the absence of uncertain parameters; then, the second-stage decision determined flows path in the presence of uncertainty. Two new mathematical models are proposed for this problem with mixed-integer linear and non-linear structures. Benders decomposition algorithm with stronger cut (Pareto-optimal cut) is used to solve proposed models. Adjustable robust models and accelerated Benders decomposition algorithms are analyzed using well-known AP data set with different levels of uncertainty. Also, a size reduction method is introduced to solve medium and large instances with good solution quality and shorter computation time. The numerical experiment shows the superiority of the Pareto-optimal cut Benders decomposition algorithm comparing with a classic one. Also, the mixed-integer non-linear model has better results in CPU time and the gap in comparison with the linear integer one. Flow balancing affects hub configuration with a decreasing number of hub facilities. Also by increasing the uncertainty budget, more hubs are established and with increasing discount factor, number of hub facilities are decreased.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alumur SA, Nickel S, da Gama FS (2012) Hub location under uncertainty. Transport Res Part B Methodol 46(4):529–543. https://doi.org/10.1016/j.trb.2011.11.006
Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4(1):238–252. https://doi.org/10.1007/BF01386316
Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math Program 99(2):351–376. https://doi.org/10.1007/s10107-003-0454-y
Ben-Tal A, El Ghaoui L, Nemirovski L (2009) Robust optimization. Princeton University Press, Princeton
Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math Program 98(1):49–71. https://doi.org/10.1007/s10107-003-0396-4
Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev 53(3):464–501. https://doi.org/10.1137/080734510
Bertsimas D, Litvinov E, Sun XA, Zhao J, Zheng T (2013) Adaptive robust optimization for the security constrained unit commitment problem. IEEE Trans Power Syst 28(1):52–63. https://doi.org/10.1109/TPWRS.2012.2205021
Campbell JF (1994) Integer programming formulations of discrete hub location problems. Eur J Oper Res 72(2):387–405. https://doi.org/10.1016/0377-2217(94)90318-2
Contreras I, Cordeau JF, Laporte G (2011) Stochastic uncapacitated hub location. Eur J Oper Res 212(3):518–528. https://doi.org/10.1016/j.ejor.2011.02.018
Correia I, Nickel S, da Gama FS (2018) A stochastic multi-period capacitated multiple allocation hub location problem: formulation and inequalities. Omega 74:122–134. https://doi.org/10.1016/j.omega.2017.01.011
Čvokić D, Stanimirović Z (2019) A single allocation hub location and pricing problem. Comput Appl Math. https://doi.org/10.1007/s40314-019-1025-z
de Sá EM, Morabito R, de Camargo RS (2018a) Benders decomposition applied to a robust multiple allocation incomplete hub location problem. Comput Oper Res 89:31–50. https://doi.org/10.1016/j.cor.2017.08.001
de Sá EM, Morabito R, de Camargo RS (2018b) Efficient benders decomposition algorithms for the robust multiple allocation incomplete hub location problem with service time requirements. Expert Syst Appl 93:50–61. https://doi.org/10.1016/j.eswa.2017.10.005
Farahani RZ, Hekmatfar M, Arabani AB, Nikbakhsh E (2013) Hub location problems: a review of models, classification, solution techniques, and applications. Comput Ind Eng 64(4):1096–1109. https://doi.org/10.1016/j.cie.2013.01.012
Ghaffarinasab N (2018) An efficient matheuristic for the robust multiple allocation p-hub median problem under polyhedral demand uncertainty. Comput Oper Res 97:31–47. https://doi.org/10.1016/j.cor.2018.04.021
Ghaffari-Nasab N, Ghazanfari M, Teimoury E (2015) Robust optimization approach to the design of hub-and-spoke networks. Int J Adv Manuf Technol 76(5):1091–1110. https://doi.org/10.1007/s00170-014-6330-5
Goldman AJ (1969) Optimal locations for centers in a network. Transport Sci 3(4):352–360. https://doi.org/10.1287/trsc.3.4.352
Habibzadeh Boukani F, Farhang Moghaddam B, Pishvaee MS (2016) Robust optimization approach to capacitated single and multiple allocation hub location problems. Comput Appl Math 35(1):45–60. https://doi.org/10.1007/s40314-014-0179-y
Jeyakumar V, Li GY (2010) Strong duality in robust convex programming: complete characterizations. SIAM J Optim 20(6):3384–3407. https://doi.org/10.1137/100791841
Karimi H, Setak M (2018) Flow shipment scheduling in an incomplete hub location-routing network design problem. Comput Appl Math. https://doi.org/10.1007/s40314-016-0368-y
Li S, Fang C, Wu Y (2020) Robust hub location problem with flow-based set-up cost. IEEE Access 8:66178–66188
Lorca Sun XA, Litvinov E, Zheng T (2016) Multistage adaptive robust optimization for the unit commitment problem. Oper Res 64(1):32–51. https://doi.org/10.1287/opre.2015.1456
Lozkins A, Krasilnikov M, Bure V (2019) Robust uncapacitated multiple allocation hub location problem under demand uncertainty: minimization of cost deviations. J Ind Eng Int. https://doi.org/10.1007/s40092-019-00329-9
Magnanti T, Wong R (1981) Accelerating benders decomposition: algorithmic enhancement and model selection criteria. Oper Res. https://doi.org/10.1287/opre.29.3.464
Merakli M, Yaman H (2016) Robust intermodal hub location under polyhedral demand uncertainty. Transport Res Part B Methodol 86:66–85. https://doi.org/10.1016/j.trb.2016.01.010
Merakli M, Yaman H (2017) A capacitated hub location problem under hose demand uncertainty. Comput Oper Res 88:58–70. https://doi.org/10.1016/j.cor.2017.06.011
O’Kelly ME (1986) The location of interacting hub facilities. Transport Sci 20(2):92–106. https://doi.org/10.1287/trsc.20.2.92
O’Kelly ME (1987) A quadratic integer program for the location of interacting hub facilities. Eur J Oper Res 32(3):393–404. https://doi.org/10.1016/S0377-2217(87)80007-3
Rahmati R, Bashiri M (2018) Robust hub location problem with uncertain inter hub flow discount factor. In: Proceedings of the international conference on industrial engineering and operations management 2018, Paris, France, 26–27 July, 2018
Shahabi M, Unnikrishnan A (2014) Robust hub network design problem. Transport Res Part E Logist Transport Rev 70:356–373. https://doi.org/10.1016/j.tre.2014.08.003
Soyster AL (1973) Technical note–convex programming with set-inclusive constraints and applications to inexact linear programming. Oper Res 21(5):1154–1157. https://doi.org/10.1287/opre.21.5.1154
Talbi EG, Todosijević R (2017) The robust uncapacitated multiple allocation p-hub median problem. Comput Ind Eng 110:322–332. https://doi.org/10.1016/j.cie.2017.06.017
Tikani H, Honarvar M, Mehrjerdi Y (2018) Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry. Comput Appl Math. https://doi.org/10.1007/s40314-017-0512-3
Zeng B, Zhao L (2013) Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper Res Lett 41(5):457–461. https://doi.org/10.1016/j.orl.2013.05.003
Zetina CA, Contreras I, Cordeau JF, Nikbakhsh E (2017) Robust uncapacitated hub location. Transport Res Part B Methodol 106:393–410. https://doi.org/10.1016/j.trb.2017.06.008
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Paulo J. S. Silva.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Rahmati, R., Neghabi, H. Adjustable robust balanced hub location problem with uncertain transportation cost. Comp. Appl. Math. 40, 14 (2021). https://doi.org/10.1007/s40314-020-01405-2
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40314-020-01405-2
Keywords
- Balanced hub location
- Benders decomposition algorithm
- Adjustable robust optimization
- Uncertain transportation cost
- Pareto-optimal cut