Abstract
The increasing availability of finely-grained parallel architectures has resulted in a variety of evolutionary algorithms (EAs) in which the population is spatially distributed and local selection algorithms operate in parallel on small, overlapping neighborhoods. The effects of design choices regarding the particular type of local selection algorithm as well as the size and shape of the neighborhood are not particularly well understood and are generally tested empirically. In this paper we extend the techniques used to more formally analyze selection methods for sequential EAs and apply them to local neighborhood models, resulting in a much clearer understanding of the effects of neighborhood size and shape.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ankenbrandt, C. A. (1991). An extension to the theory of convergence and a proof of the time complexity of genetic algorithms. In Foundations of Genetic Algorithm, San Mateo, CA, pp. 53–68. Morgan Kaufmann.
Baluja, S. (1993). Structure and performance of fine-grained parallelism in genetic search. In Proceedings of the Fifth International Conference on Genetic Algorithms, Urbana-Champaign, IL, pp. 155–162. Morgan Kaufmann.
Banks, R. B. (1994). Growth and Diffusion Phenomena. Springer-Verlag.
Collins, R. J. and D. R. Jefferson (1991). Selection in massively parallel genetic algorithms. In Proceedings of the Fourth International Conference on Genetic Algorithms, San Diego, CA, pp. 249–256. Morgan Kaufmann.
De Jong, K. and J. Sarma (1995). On decentralizing selection algorithms. In Proceedings of the Sixth International Conference on Genetic Algorithms, Pittsburgh, PA, pp. 17–23. Morgan Kaufmann.
Goldberg, D. E. and K. Deb (1991). A comparative analysis of selection schemes used in genetic algorithms. In Foundations of Genetic Algorithms, San Mateo, CA, pp. 69–93. Morgan Kaufmann.
Gorges-Schleuter, M. (1989). ASPARGOS an asynchronous parallel genetic optimization strategy. In Proceedings of the Third International Conference on Genetic Algorithms, Fairfax, VA, pp. 422–427. Morgan Kaufman.
McInerney, J. (1992). Biologically Influenced Algorithms and Parallelism in Nonlinear Optimization. Ph. D. thesis, University of California, San Diego.
Mühlenbein, H. (1991). Evolution in time and space — the parallel genetic algorithm. In Foundations of Genetic Algorithm, San Mateo, CA, pp. 316–337. Morgan Kaufmann.
Spiessens, P. and B. Manderick (1991). A massively parallel genetic algorithm: Implementation and first analysis. In Proceedings of the Fourth International Conference on Genetic Algorithms, San Diego, CA, pp. 279–287. Morgan Kaufmann.
Unwin, D. (1981). Introductory Spatial Analysis. Methuen and Co. Ltd.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sarma, J., De Jong, K. (1996). An analysis of the effects of neighborhood size and shape on local selection algorithms. In: Voigt, HM., Ebeling, W., Rechenberg, I., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN IV. PPSN 1996. Lecture Notes in Computer Science, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61723-X_988
Download citation
DOI: https://doi.org/10.1007/3-540-61723-X_988
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61723-5
Online ISBN: 978-3-540-70668-7
eBook Packages: Springer Book Archive