Cited By
View all- Simões JLourenço NMachado P(2023)All You Need is Sex for DiversityGenetic Programming10.1007/978-3-031-29573-7_18(276-291)Online publication date: 12-Apr-2023
Natural selection and mating constraints with genetic algorithms
Pages 188 - 194
Abstract
In this paper, we are modelling a situation in an evolutionary population where a genetically inherited feature is part of a distribution of probabilities that gives it low expectations to be present in the next generation, for example, recessive features. In many such cases observed in nature, such features seem to persist longer than predicted by the probabilistic odds. In our experiment, we intend to demonstrate how the fitness-proportionate selection can have an influence on the persistence of such features. In this simulation we focus on gender differentiation and mating constraints, and we examine their evolution in a mixed population where they are genetically inherited.
References
[1]
J. H. Holland, Adaptation in natural and artificial systems (Ann Arbor, USA: University of Michigan Press, 1975).
[2]
D. E. Goldberg, Genetic algorithms in search, optimization, and machine learning (Addison-Wesley, USA: Reading, 1989).
[3]
B. H. Sumida, A. I. Huston, J. M. McNamara, & W. D. Hamilton, Genetic algorithms and evolution, Journal of Theoretical Biology, 147, 1990, 59--84.
[4]
G. F. Miller & P. M. Todd, The role of mate choice in bio-computation: Sexual selection as a process of search, optimization, and diversification, in W. Banzhaf & F. H. Eeckman, (Eds.), Evolution and biocomputation: Computational models of evolution (Berlin: Springer-Verlag, 1995), 169--204.
[5]
J. Ventrella, Sexual swimmers: Emergent morphology and locomotion without a fitness function. in Proceedings of the Fourth International Conference on Simulation of Adaptive Behavior (Cambridge, USA: MIT Press/Bradford Books, 1996), 484--496.
[6]
C. K. Hemelrijk, Effects of cohesiveness on intersexual dominance relationships and spatial structure among group-living virtual entities, Proc. Eur. Conf. on Artificial Life V, Springer Verlag, 1999, 524--534.
[7]
D. Vrajitoru, Simulating gender separation with genetic algorithms. in Proceedings of the Genetic and Evolutionary Computation Conference (Morgan Kaufmann Publishers, 2002), 634--641.
[8]
J. Noble, Sexual signalling in an artificial population: When does the handicap principle work? in D. Floreano, F. Mondada, & J.-D. Nicoud, Proceeding of the European Conference on Artificial Life V, Springer Verlag, 1999, 644--653.
[9]
J. Rejeb & M. AbuElhaija, New gender genetic algorithm for solving graph partitioning problems, 43rd IEEE Midwest Symposium on Circuits and Systems, Vol. 1, IEEE, 2000, 444--446.
[10]
S. Naeem, L. J. Thompson, S. P. Lawlor, J. H. Lawton, & R. M. Woodfin, Declining biodiversity can alter the performance of ecosystems, Nature, 386, 1994, 734--737.
[11]
N. D. Martinez, Defining and measuring functional aspects of biodiversity, Biodiversity: A biology of numbers and difference (Oxford, UK: Blackwell Scientific, 1996), 114--148.
[12]
J. D. Schaffer & L. Eshelman, On crossover as an evolutionary viable startegy, in R. Belew & L. Booker, (Eds.), Proceedings of the Fourth International Conference on Genetic Algorithms (San Mateo, USA: Morgan Kaufmann Publishers, 1991), 61--68.
[13]
W. D. Hamilton, R. Axelrod, & R. Tanese, Sexual reproduction as an adaptation to resist parasites, Proceedings of the National Academy of Sciences, 87, May 1990, 3566--3573.
[14]
G. M. Werner & P. M. Todd, Too many love songs: Sexual selection and the evolution of communication, in P. Husbands & I. Harvey, (Eds.), The Fourth European Conference on Artificial Life (Cambridge, USA: MIT Press/Bradford Books, 1997).
[15]
R. Allenson, Genetic algorithms with gender for multi-function optimisation, Technical Report EPCC-SS92-01 (Edinburgh, Scotland: Edinburgh Parallel Computing Centre, 1992).
[16]
J. Sanchez-Velazco & J. A. Bullinaria, Sexual selection with competitive/co-operative operators for genetic algorithms, IASTED International Conference on Neural Networks and Computational Intelligence (NCI 2003) (Cancun, Mexico: ACTA Press, 2003).
[17]
D. Whitley, K. Mathias, S. Rana, & J. Dzubera, Evaluating evolutionary algorithms, Artificial Intelligence, 85, 1996, 245--276.
[18]
D. Vrajitoru, Simulating gender separation and mating constraints for genetic algorithms, Technical Report TR-20050520-1 (South Bend, USA: Indiana University South Bend, 2005).
[19]
K. Deb & D. E. Goldberg, Sufficient conditions for arbitrary binary functions. Annals of Mathematics and Artificial Intelligence, 10, 1994, 385--408.
[20]
C. K. Mohan, Selective crossover: Towards fitter offspring. Proc. Symp. Appl. Computing (SAC'98), Atlanta, USA 1998.
[21]
K. De Jong & M. Spears, Using genetic algorithms to solve NP-complete problems, Proc. Int. Conf. on Genetic Algorithms (Fairfax: George Mason University, 1989), 124--132.
[22]
D. Vrajitoru, Genetic programming operators applied to genetic algorithms, in Proceedings of the Genetic and Evolutionary Computation Conference (Orlando, USA: Morgan Kaufmann Publishers, 1999), 686--693.
[23]
D. Vrajitoru, Intra and extra-generation schemes for combining crossover operators, in The Midwest Artificial Intelligence and Cognitive Science Conference, Roosevelt University, IL, 2004, 86--91.
[24]
K. De Jong, An analysis of the behaviour of a class of genetic adaptive systems, Ph.D. Thesis, University of Michigan, 1975.
[25]
G. Syswerda, Uniform crossover in genetic algorithms, in J. D. Schaffer, (Ed.), Proceedings of the International Conference on Genetic Algorithms (San Mateo, USA: Morgan Kaufmann Publishers, 1989).
- Natural selection and mating constraints with genetic algorithms
Recommendations
Self-adjusting the intensity of assortative mating in genetic algorithms
Mate selection plays a crucial role in both natural and artificial systems. While traditional Evolutionary Algorithms (EA) usually engage in random mating strategies, that is, mating chance is independent of genotypic or phenotypic distance between ...
Genetic diversity as an objective in multi-objective evolutionary algorithms
A key feature of an efficient and reliable multi-objective evolutionary algorithm is the ability to maintain genetic diversity within a population of solutions. In this paper, we present a new diversity-preserving mechanism, the Genetic Diversity ...
Maintaining Genetic Diversity in Multimodal Evolutionary Algorithms using Population Injection
GECCO '16 Companion: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference CompanionIn this paper, we present a computationally inexpensive method for maintaining genetic diversity in evolutionary algorithms using population injection. As opposed to other methods, e.g., cellular EAs, population injection does not require any ...
Comments
Information & Contributors
Information
Published In
Publisher
ACTA Press
United States
Publication History
Published: 01 March 2008
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 17 Oct 2024
Other Metrics
Citations
Cited By
View all- Simões JLourenço NMachado P(2023)All You Need is Sex for DiversityGenetic Programming10.1007/978-3-031-29573-7_18(276-291)Online publication date: 12-Apr-2023
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in