Abstract
In this paper, the parallel implementation of various selection operators in evolutionary algorithms on massively parallel 2-dimensional arrays is treated. Novel parallel versions of fitness proportionate, linear ranking, and tournament selection are presented and compared. It is found that these algorithms can be implemented such that their expected behaviour is identical or very close to those of the sequential algorithms from which they originated, but with the advantage of significant speed improvements associated with parallelism.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T. Baeck. Selective pressure in evolutionary algorithms: A characterization of selection mechanisms. In 1st IEEE conference on evolutionary computing, volume 1, pages 57–62. IEEE, 1994.
J. E. Baker. Reducing bias and inefficiency in the selection algorithm. In J. Gefenstette, editor, Intl. Conf. on Genetic Algorithms, pages 14–21. Lawrence Erlbaum Associates, 1987.
T. Blickle and L. Thiele. A comparison of selection schemes used in genetic algorithms. Technical report, Swiss Federal Institute of Technology (ETH), 1995.
R.J. Collins and D.R. Jefferson. Selection in massively parallel genetic algorithms. In R.K. Belew and L.B. Booker, editors, 4th International Conference on Genetic Algorithms, pages 249–256, San Diego, CA, 1991. Morgan Kaufmann.
K. De Jong and J. Sarma. On decentralizing selection algorithms. In L. J. Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, ICGA '95, pages 17–23. Morgan Kaufmann Publishers, San Francisco, July 1995.
D. Eichberg, U. Kohlmorgen, and H. Schmeck. Feinkörnig parallele Varianten des Insel-Modells Genetischer Algorithmen. In GI-Mitteilungen: Workshop für Parallel-Algorithmen und Rechnerstrukturen. Gesellschaft für Informatik e. V., 1995.
D. E. Goldberg and D. Kalayanmoy. A comparative analysis of selection schemes used in genetic algorithms. In G. Rawlins, editor, Foundations of Genetic Algorithms, San Mateo, CA, USA, 1991. Morgan Kaufmann.
D. E. Goldberg. Genetic Algorithms. Addison-Wesley, 1989.
P.J.B. Hanrock. An empirical comparison of selection methods in evolutionary algorithms. In AISB workshop on evolutionary computation, 1994.
J. H. Holland. Adaptation in natural and artificial systems. Ann Arbor: The University of Michigan Press, 1975.
F. T. Leighton. Parallel Algorithms and Architectures. Morgan Kaufmann, 1992.
H. Muehlenbein. Evolution in time and space — the parallel genetic algorithm. In G. Rawlins, editor, Foundations of Genetic Algorithms, pages 316–337, San Mateo, CA, 1991. Morgan Kaufmann.
D. Whitley and T. Starkweather. Genitor u: a distributed genetic algorithm. Journal of Experimental and Theoretical Artificial Intelligence, 2(3):189–214, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Branke, J., Andersen, H.C., Schmeck, H. (1996). Global selection methods for massively parallel computers. In: Fogarty, T.C. (eds) Evolutionary Computing. AISB EC 1996. Lecture Notes in Computer Science, vol 1143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032782
Download citation
DOI: https://doi.org/10.1007/BFb0032782
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61749-5
Online ISBN: 978-3-540-70671-7
eBook Packages: Springer Book Archive