Abstract
In this paper the application of a Genetic Algorithm (GA) to the Steiner tree problem is described. The performance of the GA is compared to that of the Simulated Annealing Algorithm (SA) and one of the best conventional algorithms given by Rayward-Smith and Clare [1] (RCA).
Particular attention has been paid to find an optimal setting of the parameters and operators of the GA. A mutation probability P M=0.01 and a crossover probability P C=0.5 have been obtained according to the values found by Grefenstette [2]. An optimal population size has been chosen using a heuristic comparable to that of Goldberg
In addition the application of two problem specific heuristics is discussed, the removal of Steiner points of degree <3 and a local relaxation of the tree. A speedup of ≈20 was obtained if these heuristics were applied to the computation of the fitness only without changing the individuals themselves. For a fair comparison, these heuristics have been applied to the GA, the SA, and, in contrast to its original definition, to the RCA.
According to our results, all three algorithms find the optimum and converge equally fast, i.e., GA and SA need not more function evaluations than the RCA, that has even been improved by the relaxation heuristic. The GA reaches the optimum in a small number of generations which is considered the reason why it did not show an even better performance.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
V.J. Rayward-Smith, A. Clare, “On finding Steiner Vertices”, Networks, Vol. 16, 1986, pp.293–294
J.J. Grefenstette, “Optimization of Control Parameters of Genetic Algorithms”, IEEE Trans. Syst., Man &. Cybern., Vol. SMC-16, No.l, 1986, pp.122–128
D.E. Goldberg, “Optimal initial population size for binary coded Genetic Algorithms”, TGCA Rep. No.85001, Univ. of Alabama, AL, 1985
E.N. Gilbert, “Minimum cost communication networks”, Bell Sys. Tech. J., Vol. 9, 1967, pp.2209–2227
M.I. Shamos and D. Hoey, “Closest point problems”, 16th Ann. Symp. on found. of Comp. Sci., IEEE, New York, 1975, pp.151–162
E.N. Gilbert, H.O. Pollak, “Steiner Minimal Trees”, SIAM J. Appl. Math., Vol. 16, No.l, 1986, pp.1–29
M.W. Bern, R.L. Graham, “The Shortest-Network Problem”, Sci. Am., Jan. 1989, pp.66–71
J.H. Holland, “Adaption in Natural and Artificial Systems”, Univ. of Michigan Press, Ann Arbor, MI, 1975
A. Genthner., R. Hauser, H. Horner, R. Lange, R. Männer, “NERV — A Simulation System for Neural Networks”, will be publ. in: Proc. Int'l Symp. Connectionism in Perspective, Zurich, 1988
W.H. Press, B.R. Flannery, S.A. Teukolski, W.T. Vetterling, “Numerical Recipes”, Cambridge University Press, Cambridge, MA, 1986, pp.258–259
L. Davis, “Genetic Algorithms and Simulated Annealing”, Pitman, London, 1988
S. Kirkpatrick, C.D. Gelatt, M.P. Vecci, “Optimiuation by simulated annealing”, Science, Vol. 220, No.4598, 1983, pp.671–680
M. Gardner, “Casting a net on a checkerboard and other puzzles of the forest”, Sci. Am., Aug. 1986, pp.14–17
H. Mühlenbein, M. Gorges-Schleuter, O. Krämer, “Evolution algorithms in combinatorial optimization”, Parallel Computing, Vol. 7, 1985, pp.65–85
M. Gorges-Schleuter, “ASPARAGUS — An Asynchronous Parallel Genetic Optimization Strategy”, subm. to 3rd Int'l Conf. on Genetic Algorithms, 1989
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hesser, J., Männer, R., Stucky, O. (1991). On steiner trees and genetic algorithms. In: Becker, J.D., Eisele, I., Mündemann, F.W. (eds) Parallelism, Learning, Evolution. WOPPLOT 1989. Lecture Notes in Computer Science, vol 565. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55027-5_30
Download citation
DOI: https://doi.org/10.1007/3-540-55027-5_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55027-3
Online ISBN: 978-3-540-46663-5
eBook Packages: Springer Book Archive