Abstract
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists in finding a minimum weight subgraph spanning a given subset of nodes (terminals) of the original graph. We describe a reactive tabu search with path-relinking algorithm for the Steiner problem in graphs, based on the extension of a previously developed tabu search algorithm using a neighborhood defined by insertions and eliminations of Steiner nodes. Computational experiments on benchmark problems are reported, comparing the reactive tabu search with other metaheuristic implementations. The reactive tabu search algorithm outperforms other algorithms, obtaining better or comparably good solutions. We also describe a robust parallel implementation based on an independent-thread multiple-walk strategy and report improved computational results on a 32-processor cluster running under Linux.
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
R. Battiti and G. Tecchiolli. The Reactive Tabu Search. ORSA Journal on Computing, 6:126–140, 1994.
J.E. Beasley. OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operational Research Society, 41:1069–1072, 1990.
S.A. Canuto, M.G.C. Resende, and C.C. Ribeiro. Local Search with Perturbations for the Prize-Collecting Steiner Tree Problem. To appear in: Networks.
E.-A. Choukmane. Une heuristique pour le problème de l’arbre de Steiner. RAIRO Recherche Opérationnelle, 12:207–212, 1978.
V.-D. Cung, S.L. Martins, C.C. Ribeiro, and C. Roucairol. Parallel Strategies for the Implementation of Metaheuristics. In: Essays and Surveys in Metaheuristics, C.C. Ribeiro and P. Hansen, editors, Kluwer, 2001 (this volume).
K.A. Dowsland. Hill-Climbing, Simulated Annealing and the Steiner Problem in Graphs. Engineering Optimization, 17:91–107, 1991.
C.W. Duin. Steiner’s Problem in Graphs: Approximation, Reduction, Variation. Doctorate Dissertation, Institute of Actuarial Science and Economics, University of Amsterdam, 1994.
C.W. Duin and S. Voss. Efficient Path and Vertex Exchange in Steiner Tree Algorithms. Networks, 29:89–105, 1997.
H. Esbensen. Computing Near-Optimal Solutions to the Steiner Problem in a Graph Using a Genetic Algorithm. Networks, 26:173–185, 1995.
M. Gendreau, J.-F. Larochelle, and B. Sansò. A Tabu Search Heuristic for the Steiner Tree Problem. Networks, 34:163–172, 1999.
F. Glover. Tabu Search — Part I. ORSA Journal on Computing, 1:190–206, 1989.
F. Glover. Tabu Search — Part II. ORSA Journal on Computing, 2:4–32, 1990.
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, editors, pages 1–75, Kluwer, 1996.
F. Glover and M. Laguna. Tabu Search, Kluwer, 1997.
F.K. Hwang, D.S. Richards, and P. Winter. The Steiner Tree Problem. North-Holland, 1992.
R.M. Karp. Reducibility Among Combinatorial Problems. In: Complexity of Computer Computations, E. Miller and J.W. Thatcher, editors, pages 85–103, Plenum Press, 1972.
A. Kapsalis, V.J. Ray ward-Smith, and G.D. Smith. Solving the Graphical Steiner Tree Problem Using Genetic Algorithms. Journal of the Operational Research Society, 44:397–406, 1993.
T. Koch and A. Martin. Solving Steiner Tree Problems in Graphs to Optimality. Networks, 32:207–232, 1998.
L.T. Kou, G. Markowsky, and L. Berman. A Fast Algorithm for Steiner Trees. Acta Informatica, 15:141–145, 1981.
N. Maculan. The Steiner Problem in Graphs. In: Surveys in Combinatorial Optimization, S. Martello, G. Laporte, M. Minoux, and C.C. Ribeiro, editors, Annals of Discrete Mathematics, 31:185–212, 1987.
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:285–297, 1998.
S.L. Martins, P. Pardalos, M.G. Resende, and C.C. Ribeiro. Greedy Randomized Adaptive Search Procedures for the Steiner Problem in Graphs. DIM ACS Series in Discrete Mathematics and Theoretical Computer Science, 43:133–146, 1999.
S.L. Martins, P. Pardalos, M.G. Resende, and C.C. Ribeiro. A Parallel GRASP for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy. Journal of Global Optimization, 17:267–283, 2000.
Message Passing Interface Forum. MPI: A Message Passing Interface Standard, 1995.
M. Minoux. Efficient Greedy Heuristics for Steiner Tree Problems Using Reoptimization and Supermodularity. INFOR, 28:221–233, 1990.
C.C. Ribeiro and M.C. Souza. Tabu Search for the Steiner Problem in Graphs. Networks, 36:138–146, 2000.
L. Schrage. A More Portable Fortran Random Number Generator. ACM Transactions on Mathematical Software, 5:132–138, 1979.
H. Takahashi and A. Matsuyama. An Approximate Solution for the Steiner Problem in Graphs. Mathematica Japonica, 24:573–577, 1980.
M.G.A. Verhoeven and E.H.L. Aarts. Parallel Local Search. Journal of Heuristics, 1:43–65, 1995.
S. Voss. Steiner-Probleme in Graphen. Anton Hain, 1990.
S. Voss. Steiner’s Problem in Graphs: Heuristic Methods. Discrete Applied Mathematics, 40:45–72, 1992.
P. Winter. Steiner Problem in Networks: A Survey. Networks, 17:129–167, 1987.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bastos, M.P., Ribeiro, C.C. (2002). Reactive Tabu Search with Path-Relinking for the Steiner Problem in Graphs. In: Essays and Surveys in Metaheuristics. Operations Research/Computer Science Interfaces Series, vol 15. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1507-4_2
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1507-4_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5588-5
Online ISBN: 978-1-4615-1507-4
eBook Packages: Springer Book Archive