Abstract
The capacitated single assignment hub location problem with modular link capacities is a variant of the classical hub location problem in which the cost of using edges is not linear but stepwise, and the hubs are restricted in terms of transit capacity rather than in the incoming traffic. We propose a metaheuristic algorithm based on strategic oscillation, a methodology originally introduced in the context of tabu search. Our method incorporates several designs for constructive and destructive algorithms, together with associated local search procedures, to balance diversification and intensification for an efficient search. Computational results on a large set of instances show that, in contrast to exact methods that can only solve small instances optimally, our metaheuristic is able to find high-quality solutions on larger instances in short computing times. In addition, the new method, which joins tabu search strategies with strategic oscillation, outperforms the previous tabu search implementation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
ORLIB website http://people.brunel.ac.uk/~mastjjb/jeb/info.html.
References
Alumur, S., Kara, B.Y.: Network hub location problems: the state of the art. Eur. J. Oper. Res. 190(1), 1–21 (2008)
Beasley, J.E.: OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069–1072 (1990)
Campbell, J.F., Ernst, A.T., Krishnamoorthy, M.: Hub location problems. In: Drezner, Z., Hammacher, H. (eds.) Facility Location: Applications and Theory, pp. 373–407. Springer, Berlin (2002)
Campbell, J.F., O’Kelly, M.E.: Twenty-five years of hub location research. Trans. Sci. 46(2), 153–169 (2012)
Ernst, A.T., Krishnamoorthy, M.: Efficient algorithms for the uncapacitated single allocation p-hub median problem. Locat. Sci. 4(3), 139–154 (1996)
Fanjul-Peyró, L., Ruiz, R.: Iterated greedy local search methods for unrelated parallel machine scheduling. Eur. J. Oper. Res. 207(1), 55–69 (2010)
Farahani, R.Z., Hekmatfar, M.: Facilities Location: Concepts, Models, Algorithms and Case Studies. Springer, Berlin (2009)
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)
Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8(1), 156–166 (1977)
Glover, F., Laguna, M.: Tabu Search. Kluwer, Norwell (1997)
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)
Jacobs, L., Brusco, M.: A local-search heuristic for large set-covering problems. Naval Res. Logist. 42(7), 1129–1140 (1995)
Kress, D., Pesch, E.: Sequential competitive location on networks. Eur. J. Oper. Res. 217(3), 483–499 (2012)
Lozano, M., Molina, D., García-Martínez, C.: Iterated greedy for the maximum diversity problem. Eur. J. Oper. Res. 214(1), 31–38 (2011)
Melo, M.T., Nickel, S., Saldanha da Gama, F.: Facility location and supply chain management—a review. Eur. J. Oper. Res. 196(2), 401–412 (2009)
Nickel, S., Puerto, J.: Location Theory: A Unified Approach. Springer, Berlin (2005)
O’Kelly, M.E.: A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32(3), 393–404 (1987)
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)
ReVelle, C., Eiselt, H.: Location analysis: a synthesis and survey. Eur. J. Oper. Res. 165(1), 1–19 (2005)
ReVelle, C., Eiselt, H., Daskin, M.: A bibliography for some fundamental problem categories in discrete location science. Eur. J. Oper. Res. 184(3), 817–848 (2008)
Ruiz, R., Stützle, T.: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur. J. Oper. Res. 187(3), 1143–1159 (2008)
Ruiz, R., Stützle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur. J. Oper. Res. 177(3), 2033–2049 (2008)
Yaman, H.: Concentrator Location in Telecommunication Networks. Ph.D. thesis, Université Libre de Bruxelles, Brussels, Belgium (2002)
Yaman, H., Carello, G.: Solving the hub location problem with modular link capacities. Comput. Oper. Res. 32(12), 3227–3245 (2005)
Ying, K., Cheng, H.: Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic. Expert Syst. Appl. 37(4), 2848–2852 (2010)
Acknowledgments
This work was supported by the Spanish Ministerio de Economía y Competitividad (Projects TIN2012-35632-C02-01, MTM2012-36163-C06-02, TIN2015-65460-C02-01, MTM2015-68097, and Predoctoral Grant BES-2013-064245) and by the Generalitat Valenciana (Project Prometeo 2013/049). Authors thank Hande Yaman for providing us some data files for the test problems in Table 3. Authors also want to thank two anonymous referees for their many comments and suggestions on the manuscript that have helped to improve its content and readability.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Corberán, Á., Peiró, J., Campos, V. et al. Strategic oscillation for the capacitated hub location problem with modular links. J Heuristics 22, 221–244 (2016). https://doi.org/10.1007/s10732-016-9308-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-016-9308-7