Advertisement

New Benchmark Instances for The Steiner Problem in Graphs

  • Isabel Rosseti
  • Marcus Poggi de Aragão
  • Celso C. Ribeiro
  • Eduardo Uchoa
  • Renato F. Werneck
Part of the Applied Optimization book series (APOP, volume 86)

Abstract

We propose in this work 50 new test instances for the Steiner problem in graphs. These instances are characterized by large integrality gaps (between the optimal integer solution and that of the linear programming relaxation) and symmetry aspects which make them harder to both exact methods and heuristics than the test instances currently in use for the evaluation and comparison of existing and newly developed algorithms. Our computational results indicate that these new instances are not amenable to reductions by current preprocessing techniques and that not only do the linear programming lower bounds show large gaps, but they are also hard to be computed. State-of-the-art heuristics, which found optimal solutions for almost all test instances currently in use, faced much more difficulties for the new instances. Fewer optimal solutions were found and the numerical results are more discriminant, allowing a better assessment of the effectiveness and the relative behavior of different heuristics.

Keywords

Steiner problem in graphs Benchmark instances Test instances Algorithms. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. M.P. Bastos and C.C. Ribeiro. Reactive tabu search with path-relinking for the Steiner problem in graphs. In C.C. Ribeiro and P. Hansen, editors, Essays and Surveys in Metaheuristics, pages 39–58. Kluwer, 2002.Google Scholar
  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. M. Poggi de Aragäo and C.C. de Souza. Upper bounds for minimum covering codes via tabu search. In Extended Abstracts of the 3rd Metaheuristics International Conference, pages 359–364. Angra dos Reis, 1999.Google Scholar
  4. M. Poggi de Aragäo, C.C. Ribeiro, E. Uchoa, and R.F. Werneck. Hybrid local search for the Steiner problem in graphs. In Extended Abstracts of the 4th Metaheuristics International Conference, pages 429–433. Porto, 2001a.Google Scholar
  5. M. Poggi de Aragäo, E. Uchoa, and R.F. Werneck. Dual heuristics on the exact solution of large Steiner problems. Electronic Notes in Discrete Mathematics, 7, 2001b.Google Scholar
  6. 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
  7. C.W. Duin and T. Volgenant. Reduction tests for the Steiner problem in graphs. Networks, 19: 549–567, 1989.MathSciNetzbMATHCrossRefGoogle Scholar
  8. C.W. Duin and S. Voss. Efficient path and vertex exchange in Steiner tree algorithms. Networks, 29: 89–105, 1997.MathSciNetzbMATHCrossRefGoogle Scholar
  9. C.W. Duin and S. Voss. The Pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs. Networks, 34: 181–191, 1999.MathSciNetzbMATHCrossRefGoogle Scholar
  10. M. Gendreau, J.-F. Larochelle, and B. Sansb. A tabu search heuristic for the Steiner tree problem. Networks, 34: 163–172, 1999.CrossRefGoogle Scholar
  11. T. Koch and A. Martin. Solving Steiner tree problems in graphs to optimality. Networks, 32: 207–232, 1998.MathSciNetzbMATHCrossRefGoogle Scholar
  12. A.P. Lucena and J.E. Beasley. A branch and cut algorithm for the Steiner problem in graphs. Networks, 31: 39–59, 1998.MathSciNetzbMATHCrossRefGoogle Scholar
  13. T. Koch A. Martin and S. Voss. Steinlib: An updated library on Steiner tree problems in graphs, 2000. Online document at http://elib.zib.de/steinlib/steinlib.php, last visited on March 20, 2003.Google Scholar
  14. 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.MathSciNetzbMATHCrossRefGoogle Scholar
  15. T. Polzin and S. Vandati. Improved algorithms for the Steiner problem in networks. Discrete Applied Mathematics, 112: 263–300, 2001.MathSciNetzbMATHCrossRefGoogle Scholar
  16. C.C. Ribeiro and M.C. Souza. Tabu search for the Steiner problem in graphs. Networks, 36: 138–146, 2000.MathSciNetzbMATHCrossRefGoogle Scholar
  17. C.C. Ribeiro, E. Uchoa, and R.F. Werneck. A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing, 14: 228–246, 2002.MathSciNetzbMATHCrossRefGoogle Scholar
  18. H. Takahashi and A. Matsuyama. An approximate solution for the Steiner problem in graphs. Math. Japonica, 24: 573–577, 1980.MathSciNetzbMATHGoogle Scholar
  19. E. Uchoa, M. Poggi de Aragâo, and C.C. Ribeiro. Preprocessing Steiner problems from VLSI layout. Networks, 40: 38–50, 2002.MathSciNetzbMATHCrossRefGoogle Scholar
  20. J.H. van Lint. Recent results on perfect codes and related topics. In M. Hall Jr. and eds. J.H. van Lint, editors, Combinatorics, pages 163–183. Kluwer, 1975.Google Scholar
  21. D.B. West. Introduction to graph theory. Prentice-Hall, 2000.Google Scholar
  22. R. Wong. A dual ascent approach for Steiner tree problems on a directed graph. Mathematical Programming, 28: 271–287, 1984.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Isabel Rosseti
    • 1
  • Marcus Poggi de Aragão
    • 1
  • Celso C. Ribeiro
    • 1
  • Eduardo Uchoa
    • 1
  • Renato F. Werneck
    • 1
  1. 1.Department of Computer ScienceCatholic University of Rio de JaneiroRio de JaneiroBrazil

Personalised recommendations