Abstract
By memorizing alleles that have been successful in the past, polyploidy has been found to be beneficial for adapting to changing environments. This paper explores the benefits of using polyploidy in Genetic Algorithms. Polyploidy is provided in our approach by using a local chromosome to reflect dominance in diploid and tetraploid organisms, with and without evolving crossover points, added to provide linkage between chromosomes and the dominance control vector. We compare our polyploid approach to a haploid implementation for a benchmark that involves a 0/1 knapsack problem with time varying weight constraints.
Preview
Unable to display preview. Download preview PDF.
References
Bagley, J. D., The Behavior of Adaptive Systems Which Employ Genetic and Correlation Algorithms. (Doctoral dissertation, University of Michigan). 1967, Dissertation Abstracts International 28(12), 5106B. (University Microfilms No. 68-7556).
Brindle, A., Genetic Algorithms for Function Optimization. Unpublished doctoral dissertation, University of Alberta, Edmonton.
Eschelman, L. J., Caruana, R.A., and Schaffer, J.D., Biases in the Crossover Landscape, Proceedings of the 3rd International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, Los Altos, CA, 1989.
Goldberg, D. E., Genetic Algorithms in Search, Optimization, and Machine Learning, MA, Addison Wesley, 1989.
Goldberg, D.E., & Rudnick, M. W., “Genetic algorithms and the variance of fitness,” Complex Systems, 5(3). 265–278.
Holland, J. H., Adaptation in natural and artificial systems. Ann Arbor: The University of Michigan Press, 1975.
Holstien, R. B. Artificial Genetic Adaptation in Computer Control Systems. (Doctoral dissertation, University of Michigan). Dissertation Abstracts International, 32(3), 1510B. (University Microfilms No. 71-23773).
Michalewicz, Zbigniew, Genetic Algorithms + Data Structures = Evolution Programs, Berlin, Springer-Verlag, 1994.
Ng, K. P., & Wong, K. C., A New Diploid Scheme and Dominance Change Mechanism for Non-Stationary Function Optimization, Proceedings of the Sixth International Conference. on Genetic Algorithms, CA, Morgan Kaufmann, 1995.
Smith, R.E., & Goldberg, D.E., Diploidy and Dominance in Artificial Genetic Search, Complex Systems 6(1992), 251–285.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hadad, B.S., Eick, C.F. (1997). Supporting polyploidy in genetic algorithms using dominance vectors. In: Angeline, P.J., Reynolds, R.G., McDonnell, J.R., Eberhart, R. (eds) Evolutionary Programming VI. EP 1997. Lecture Notes in Computer Science, vol 1213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014814
Download citation
DOI: https://doi.org/10.1007/BFb0014814
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62788-3
Online ISBN: 978-3-540-68518-0
eBook Packages: Springer Book Archive