Abstract
We consider the hub location problem in which the capacity of a hub restricts the amount of traffic transiting through the hub, the capacity of a hub is a decision variable, and each non-hub can only be allocated to a certain number of hubs. The objective is to determine the number of hubs, to locate the hubs, to determine the capacity level of each hub, to allocate the non-hubs to the hubs, and to determine the path for each origin-destination pair such that the total cost is minimized. Two heuristics based on the threshold accepting method are proposed to resolve this type of hub location problems. Computational characteristics of the proposed heuristics are evaluated through computational experiments using the modified CAB and AP data sets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lee, Y., Lim, B., Park, J.: A hub location problem in designing digital data service networks: Lagrangian relaxation approach. Location Science 4, 185–194 (1996)
Kuby, M., Gray, R.: Hub network design problem with stopovers and feeders: case of Federal Express. Transportation Research 27, 1–12 (1993)
Campbell, J., O’Kelly, M.E.: Twenty-five years of hub location research. Transportation Science 46, 153–169 (2012)
Campbell, J.: Integer programming formulations of discrete hub location problems. European Journal of Operational Research 72, 387–405 (1994)
Carello, G., Della Croce, F., Ghirardi, M., Tadei, R.: Solving the hub location problem in telecommunication network design: a local search approach. Networks 44, 94–105 (2004)
Rodriguez-Martin, I., Salazar-Gonzalez, J.: Solving a capacitated hub location problem. European Journal of Operational Research 184, 468–479 (2008)
Ernst, A., Krishnamoorthy, M.: Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research 86, 141–159 (1999)
Randall, M.: Solution approaches for the capacitated single allocation hub location problem using ant colony optimization. Computational Optimization and Applications 39, 239–261 (2008)
Yaman, H.: Allocation strategies in hub networks. European Journal of Operational Research 211, 442–451 (2011)
Correia, I., Nickel, S., Saladaha-da-Gama, F.: Hub and spoke network design with single-assignment, capacity decision and balancing requirements. Applied Mathematical Modelling 35, 4841–4851 (2011)
Dueck, G., Scheuer, T.: Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics 90, 161–175 (1990)
Chen, J.-F.: A hybrid heuristic for the uncapacitated hub location problem. Omega-The International Journal of Management Science 35, 211–220 (2007)
O’Kelly, M.: A quadratic integer problem for the location of interacting hub facilities. European Journal of Operational Research 32, 393–404 (1987)
Ernst, A., Krishnamoorthy, M.: Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science 4, 139–154 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, JF. (2013). Heuristics for Hub Location Problems with Alternative Capacity Levels and Allocation Constraints. In: Huang, DS., Bevilacqua, V., Figueroa, J.C., Premaratne, P. (eds) Intelligent Computing Theories. ICIC 2013. Lecture Notes in Computer Science, vol 7995. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39479-9_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-39479-9_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39478-2
Online ISBN: 978-3-642-39479-9
eBook Packages: Computer ScienceComputer Science (R0)