Abstract
Spatially-structured populations are one approach to increasing genetic diversity in an evolutionary algorithm (EA). However, they are susceptible to convergence to a single peak in a multimodal fitness landscape. Niching methods, such as fitness sharing, allow an EA to maintain multiple solutions in a single population, however they have rarely been used in conjunction with spatially-structured populations. This paper introduces local sharing, a method that applies sharing to the overlapping demes of a spatially-structured population. The combination of these two methods succeeds in maintaining multiple solutions in problems that have previously proved difficult for sharing alone (and vice-versa).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Mahfoud, S.W.: Niching methods for genetic algorithms. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, IL, USA, IlliGAL Report 95001 (1995)
Goldberg, D.E., Richardson, J.: Genetic algorithms with sharing for multi-modal function optimisation. In: Proc of the 2nd Int. Conf. on Genetic Algorithms and Their Applications, pp. 41–49 (1987)
Spears, W.M.: Simple subpopulation schemes. In: Sebald, A.V., Fogel, L.J. (eds.) Evolutionary Programming: Proc. of the Third Annual Conf., pp. 296–307. World Scientific Press, Singapore (1994)
Holland, J.H.: Adaptation in Natural and Artificial Systems, 2nd edn. MIT Press, Cambridge (1992)
Tomassini, M.: Spatially structured evolutionary algorithms. Springer, Heidelberg (2005)
Wright, S.: Isolation by distance. Genetics 28(2), 114–138 (1943)
Mayr, E.: Populations, species and evolution; an abridgment of Animal species and evolution. Harvard University Press (1970)
De Jong, K.A.: An Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, Ann Arbor, MI (1975), Dissertation Abstracts International 36(10), 5140B, University Microfilms Number 76-9381
Mahfoud, S.W.: A comparison of parallel and sequential niching methods. In: Eshelman, L. (ed.) Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 136–143. Morgan Kaufmann, San Francisco (1995)
Goldberg, D.E., Deb, K., Horn, J.: Massive multimodality, deception, and genetic algorithms. In: Männer, R., Manderick, B. (eds.) Parallel Problem Solving from Nature, vol. 2, pp. 37–46. Elsevier Science Publishers, BV, Amsterdam (1992)
Mahfoud, S.W.: Population size and genetic drift in fitness sharing. In: Whitley, L.D., Vose, M.D. (eds.) Foundations of genetic algorithms, vol. 3, pp. 185–224. Morgan Kaufmann, San Francisco (1995)
Baker, J.E.: Reducing bias and inefficiency in the selection algorithm. In: Grefenstette, J.J. (ed.) Genetic Algorithms and their Applications (ICGA 1987), pp. 14–21. Lawrence Erlbaum, Hillsdale, New Jersey (1987)
Sarma, J.: An Analysis of Decentralized and Spatially Distributed Genetic Algorithms. PhD thesis, George Mason University, Fairfax VA, USA, double sided (1998)
Deb, K., Goldberg, D.E.: An investigation of niche and species formation in genetic function optimization. In: Schaffer, J.D. (ed.) Proc. of the Third Int. Conf. on Genetic Algorithms, pp. 42–50. Morgan Kaufmann, San Mateo (1989)
Goldberg, D.E.: A note on Boltzmann tournament selection for genetic algorithms and population–oriented simulated annealing. Complex Systems 4(4), 445–460 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dick, G., Whigham, P.A. (2006). Spatially-Structured Evolutionary Algorithms and Sharing: Do They Mix?. In: Wang, TD., et al. Simulated Evolution and Learning. SEAL 2006. Lecture Notes in Computer Science, vol 4247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11903697_58
Download citation
DOI: https://doi.org/10.1007/11903697_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47331-2
Online ISBN: 978-3-540-47332-9
eBook Packages: Computer ScienceComputer Science (R0)