Abstract
The ρ – hub median problem is an NP hard location – allocation problem, which consists of finding p points to establish facilities and the assignment of the users to these points. A new evolutionary approach that has been very effective for solving optimisation problems is Path Relinking, an extension of Scatter Search that links solutions over neighborhood spaces. Path Relinking gives a framework for combining solutions that goes beyond the crossover mechanism of genetic algorithms, and introduces new fundamental principles, such as the use of systematic strategies instead of random strategies. In this paper, we present an application of Path Relinking to solve the p – hub median problem and compare its effectiveness with other classical techniques. This procedure provides high quality solutions in reasonable execution times and yields a significant improvement in the size of the problems that can be solved.
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
Ernst, A.T., Krishnamoorthy, M.: 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
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pérez Pérez, M., Almeida Rodríguez, F., Moreno Vega, J.M. (2004). On the Use of Path Relinking for the ρ – Hub Median Problem. In: Gottlieb, J., Raidl, G.R. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2004. Lecture Notes in Computer Science, vol 3004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24652-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-24652-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21367-3
Online ISBN: 978-3-540-24652-7
eBook Packages: Springer Book Archive