Abstract
The p – hub median problem is an NP hard location – allocation problem, that consists of finding p points to establish facilities and the assignment of the users to these points. In the capacitated version of this problem, each hub has got a maximum capacity limiting the traffic to be assigned. A new evolutionary approach that has been very effective for solving optimization problems is Path Relinking, an extension of Scatter Search that links solutions over neighborhood spaces. GRASP is a well-known randomized multistart metaheuristic. In this paper, we present a hybrid GRASP-Path Relinking for the capacitated p – hub median problem where the GRASP is used to construct the population of the Path Relinking. Computational results demonstrate that the hybrid GRASP-Path Relinking provides better solutions, in terms of both running times and solution quality.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Andreas, T.: Ernst and Mohan Krishnamoorthy, Efficient Algorithms for the Uncapacitated Single Allocation p-hub Median Problem. Location Science 4(3), 130–154 (1995)
Beasley, J.E.: OR-library, http://mscmga.ms.ic.ac.uk/info.html
Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109–133 (1995)
Glover, F.: Heuristics for Integer Programming Using Surrogate Constraints. Decision Sciences 8(1), 156–166 (1977)
Glover, F.: Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms). Discrete Applied Mathematics 49, 231–255 (1994)
Glover, F., Laguna, M., Marti, R.: Fundamentals of Scatter Search and Path Relinking. Control and Cybernetics 29(3), 653–684 (2000)
Klincewicz, J.G.: Heuristics for the p-hub location problem. European Journal of Operational Research 53, 25–37 (1991)
Klincewicz, J.G.: Avoiding local optima in the p-hub location problem using tabu search and GRASP. Annals of Operation Research 40, 283–302 (1992)
Pérez, M., Almeida, F., Moreno–Vega, J.M.: Fast Heuristics for the p-hub Location Problem, presented in EWGLAX, Murcia, Spain (1998)
Pérez, M., Almeida, F., Moreno–Vega, J.M.: Genetic Algorithm with Multistart Search for the p-Hub Median Problem. In: Proceedings of EUROMICRO 1998, pp. 702–707. IEEE Computer Society, Los Alamitos (2000)
O’Kelly, M.: The location of interacting hub facilities. Transportation Science 20, 92–106 (1986)
Skorin-Kapov, D., Skorin-Kapov, J.: On tabu search for the location of interacting hub facilities. European Journal of Operations Research 73, 502–509 (1994)
Ernst, A.T., Hamacher, H., Jiang, H., Krishnamoorthy, M., Woeginger, G.: Uncapacitated Single and Multiple Allocation p-Hub Center Problems (2002) (to appear)
Ernst, A.T., Krishnamoorthy, M.: Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research 86, 141–159 (1999)
Ayking, T.: Lagrangian relaxation based approaches to capacitated hub and spoke network design problem. European Journal of Operational Research 77, 1–23 (1994)
Laguna, M., Martí, R.: Scatter Search. Kluwer Academic Publishers, Dordrecht (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pérez, M., Almeida, F., Moreno-Vega, J.M. (2005). A Hybrid GRASP-Path Relinking Algorithm for the Capacitated p – hub Median Problem. In: Blesa, M.J., Blum, C., Roli, A., Sampels, M. (eds) Hybrid Metaheuristics. HM 2005. Lecture Notes in Computer Science, vol 3636. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546245_13
Download citation
DOI: https://doi.org/10.1007/11546245_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28535-9
Online ISBN: 978-3-540-31898-9
eBook Packages: Computer ScienceComputer Science (R0)