New Benchmark Instances for The Steiner Problem in Graphs
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.
KeywordsSteiner problem in graphs Benchmark instances Test instances Algorithms.
Unable to display preview. Download preview PDF.
- 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
- J.E. Beasley. OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41: 1069–1072, 1990.Google Scholar
- 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
- 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
- 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
- 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
- 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
- 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
- D.B. West. Introduction to graph theory. Prentice-Hall, 2000.Google Scholar