Abstract
A multiploid genotype comprises a number of chromosomes, and a ‘dominance’ mechanism underlying its interpretation. The simplest dominance mechanism uses a ‘mask’ chromosome, genes in which determine which gene from which chromosome is expressed at each locus. Previous work using contrived test problems showed that a multiploid was sometimes better than a normal genetic algorithm (GA), and sometimes not. Multiploidy seemed particularly helpful in cases where a normal GA would be likely to irretrievably lose important genetic material. Here we continute this investigation in the context of more realistic problems: the multiple knapsack problem, and the set covering problem. There are many complex effects, but experiments tend overall to reinforce the above suggestion.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.D. Bagley. The Behaviour of Adaptive Systems Which Employ Genetic and Correlation Algorithms. PhD thesis, University of Michigan, 1967.
J.E. Beasley. OR-libraxy: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41:1069–1072, 1990.
Emma Collingwood, David Corne, and Peter Ross. Useful diversity via multiploidy. In Proceedings of the IEEE International Conference on Evolutionary Computation 1996, 1996. to appear.
Dipankar Dasgupta and Douglas R. McGregor. Using structured genetic algorithms for solving deceptive problems. Technical report, University of Strathclyde Department of Computer Science, 1993.
D. E. Goldberg. Simple genetic algorithms and the minimal deceptive problem. In L. Davis, editor, Genetic algorithms and simulated annealing, Research Notes in AI, chapter 6, pages 74–88. Pitman, London, 1987.
Luis F. González-Hernández and David W. Corne. Evolutionary divide and conquer for the set covering problem. In T. Fogarty, editor, Evolutionary Computing: Proceedings of the AISB Workshop, Brighton, 1996. Springer, 1996.
Darrell Whitley. The GENITOR algorithm and selection pressure. In J. D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 161–121. San Mateo: Morgan Kaufmann, 1989.
Yukiko Yoshida and Nobue Adachi. A diploid genetic algorithm for preserving population diversity — pseudo-meiosis ga. In Manner Davidor, Schwefel, editor, Parallel Problem Solving from Nature: PPSN III, pages 36–45. Springer-Verlag, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corne, D., Collingwood, E., Ross, P. (1996). Investigating multiploidy's niche. 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/BFb0032783
Download citation
DOI: https://doi.org/10.1007/BFb0032783
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