Advertisement

Reactive Tabu Search with Path-Relinking for the Steiner Problem in Graphs

  • Marcelo P. Bastos
  • Celso C. Ribeiro
Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 15)

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.

Keywords

Tabu Search Average Relative Error Tabu Search Algorithm Local Search Procedure Steiner Tree Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R. Battiti and G. Tecchiolli. The Reactive Tabu Search. ORSA Journal on Computing, 6:126–140, 1994.MATHCrossRefGoogle Scholar
  2. [2]
    J.E. Beasley. OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operational Research Society, 41:1069–1072, 1990.Google Scholar
  3. [3]
    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. Google Scholar
  4. [4]
    E.-A. Choukmane. Une heuristique pour le problème de l’arbre de Steiner. RAIRO Recherche Opérationnelle, 12:207–212, 1978.Google Scholar
  5. [5]
    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).Google Scholar
  6. [6]
    K.A. Dowsland. Hill-Climbing, Simulated Annealing and the Steiner Problem in Graphs. Engineering Optimization, 17:91–107, 1991.CrossRefGoogle Scholar
  7. [7]
    C.W. Duin. Steiner’s Problem in Graphs: Approximation, Reduction, Variation. Doctorate Dissertation, Institute of Actuarial Science and Economics, University of Amsterdam, 1994.Google Scholar
  8. [8]
    C.W. Duin and S. Voss. Efficient Path and Vertex Exchange in Steiner Tree Algorithms. Networks, 29:89–105, 1997.MathSciNetMATHCrossRefGoogle Scholar
  9. [9]
    H. Esbensen. Computing Near-Optimal Solutions to the Steiner Problem in a Graph Using a Genetic Algorithm. Networks, 26:173–185, 1995.MATHCrossRefGoogle Scholar
  10. [10]
    M. Gendreau, J.-F. Larochelle, and B. Sansò. A Tabu Search Heuristic for the Steiner Tree Problem. Networks, 34:163–172, 1999.CrossRefGoogle Scholar
  11. [11]
    F. Glover. Tabu Search — Part I. ORSA Journal on Computing, 1:190–206, 1989.MathSciNetMATHCrossRefGoogle Scholar
  12. [12]
    F. Glover. Tabu Search — Part II. ORSA Journal on Computing, 2:4–32, 1990.MATHCrossRefGoogle Scholar
  13. [13]
    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.Google Scholar
  14. [14]
    F. Glover and M. Laguna. Tabu Search, Kluwer, 1997.MATHCrossRefGoogle Scholar
  15. [15]
    F.K. Hwang, D.S. Richards, and P. Winter. The Steiner Tree Problem. North-Holland, 1992.MATHGoogle Scholar
  16. [16]
    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.CrossRefGoogle Scholar
  17. [17]
    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.MATHGoogle Scholar
  18. [18]
    T. Koch and A. Martin. Solving Steiner Tree Problems in Graphs to Optimality. Networks, 32:207–232, 1998.MathSciNetMATHCrossRefGoogle Scholar
  19. [19]
    L.T. Kou, G. Markowsky, and L. Berman. A Fast Algorithm for Steiner Trees. Acta Informatica, 15:141–145, 1981.MathSciNetMATHCrossRefGoogle Scholar
  20. [20]
    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.CrossRefGoogle Scholar
  21. [21]
    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.MathSciNetCrossRefGoogle Scholar
  22. [22]
    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.MathSciNetGoogle Scholar
  23. [23]
    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.MathSciNetMATHCrossRefGoogle Scholar
  24. [24]
    Message Passing Interface Forum. MPI: A Message Passing Interface Standard, 1995.Google Scholar
  25. [25]
    M. Minoux. Efficient Greedy Heuristics for Steiner Tree Problems Using Reoptimization and Supermodularity. INFOR, 28:221–233, 1990.MATHGoogle Scholar
  26. [26]
    C.C. Ribeiro and M.C. Souza. Tabu Search for the Steiner Problem in Graphs. Networks, 36:138–146, 2000.MathSciNetMATHCrossRefGoogle Scholar
  27. [27]
    L. Schrage. A More Portable Fortran Random Number Generator. ACM Transactions on Mathematical Software, 5:132–138, 1979.MATHCrossRefGoogle Scholar
  28. [28]
    H. Takahashi and A. Matsuyama. An Approximate Solution for the Steiner Problem in Graphs. Mathematica Japonica, 24:573–577, 1980.MathSciNetMATHGoogle Scholar
  29. [29]
    M.G.A. Verhoeven and E.H.L. Aarts. Parallel Local Search. Journal of Heuristics, 1:43–65, 1995.MATHCrossRefGoogle Scholar
  30. [30]
    S. Voss. Steiner-Probleme in Graphen. Anton Hain, 1990.MATHGoogle Scholar
  31. [31]
    S. Voss. Steiner’s Problem in Graphs: Heuristic Methods. Discrete Applied Mathematics, 40:45–72, 1992.MathSciNetMATHCrossRefGoogle Scholar
  32. [32]
    P. Winter. Steiner Problem in Networks: A Survey. Networks, 17:129–167, 1987.MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Marcelo P. Bastos
    • 1
  • Celso C. Ribeiro
    • 1
  1. 1.Department of Computer ScienceCatholic University of Rio de JaneiroRio de JaneiroBrazil

Personalised recommendations