| Article ID: | iaor20001047 |
| Country: | Greece |
| Volume: | 11 |
| Issue: | 1 |
| Start Page Number: | 219 |
| End Page Number: | 241 |
| Publication Date: | Dec 1997 |
| Journal: | Studies In Locational Analysis |
| Authors: | Rayward-Smith V.J., Wade A.S.C |
| Keywords: | Steiner problem |
We present a number of local search algorithms for the Steiner problem in graphs. The comparative performance of path and vertex based neighbourhood functions is studied. Computational results are presented for the Beasley B, C, D, and E problem sets. The most promising approach is a Simulated Annealing algorithm which regularly changes its search space topology by changing representation and neighbourhood function. This approach can solve successfully all the Beasley instances and, in most cases, solutions are found in under 15 minutes.