Abstract
We propose a parallel GRASP heuristic with path-relinking for the 2-path network design problem. A parallel strategy for its implementation is described. Computational results illustrating the effectiveness of the new heuristic are reported. The parallel implementation obtains linear speedups on a cluster with 32 machines.
Chapter PDF
Similar content being viewed by others
References
S.A. Canuto, M.G.C. Resende, AND C.C. Ribeiro, “Local search with perturbations for the prize-collecting Steiner tree problem in graphs”, Networks 38 (2001), 50–58.
V.D. Cung, S.L. Martins, C.C. Ribeiro, AND C. Roucairol, “Strategies for the parallel implementation of metaheuristics”, in Essays and Surveys in Meta-heuristics (C.C. Ribeiro and P. Hansen, eds.), pages 263–308, Kluwer, 2001.
G. Dahl AND B. Johannessen, “The 2-path network design problem”, submitted for publication, 2000.
T.A. Feo AND M.C.G. Resende, “Greedy randomized adaptive search procedures”, Journal of Global Optimization 6 (1995), 109–133.
F. Glover, “Tabu search and adaptive memory programing-Advances, applications and challenges”, in Interfaces in Computer Science and Operations Research (R.S. Barr, R.V. Helgason, and J.L. Kennington, eds.), pages 1–75, Kluwer, 1996.
R. Jain, The art of Computer Systems Performance Analysis: Techniques for Experimental Desgin, Measurement, Simulation, and Modeling, Wiley, 1991.
M. Laguna AND R. MartÍ, “GRASP and path relinking for 2-layer straight line crossing minimization”, INFORMS Journal on Computing 11 (1999), 44–52.
S.L. Martins, M.G.C. Resende, C.C. Ribeiro, AND P. Pardalos, “A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy”, Journal of Global Optimization 17 (2000), 267–283.
S.L. Martins, C.C. Ribeiro, AND M.C. Souza, “A parallel GRASP for the Steiner problem in graphs”, Lecture Notes in Computer Science 1457 (1998), 285–297.
M.G.C. Resende AND C.C. Ribeiro, “GRASP”, to appear in State-of-the-Art Handbook of Metaheuristics (F. Glover and G. Kochenberger, eds.), Kluwer.
C.C. Ribeiro, E. Uchoa, AND R.F. Werneck, “A hybrid GRASP with perturbations for the Steiner problem in graphs”, to appear in INFORMS Journal on Computing.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ribeiro, C.C., Rosseti, I. (2002). A Parallel GRASP Heuristic for the 2-Path Network Design Problem. In: Monien, B., Feldmann, R. (eds) Euro-Par 2002 Parallel Processing. Euro-Par 2002. Lecture Notes in Computer Science, vol 2400. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45706-2_131
Download citation
DOI: https://doi.org/10.1007/3-540-45706-2_131
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44049-9
Online ISBN: 978-3-540-45706-0
eBook Packages: Springer Book Archive