Abstract
A multi-population genetic algorithm is proposed which is hierarchical in nature. This allows the algorithm to solve problems which consist of smaller tasks contributing to the solution of an overall problem. The algorithm feeds the entire pool of individuals between local populations (solving the smaller problems) and a global population (solving the overall task). Results on categorisation tasks are presented.
This is a preview of subscription content, log in via an institution to check access.
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
B.G. Batchelor. A Practical Approach to Pattern Design Recognition. Plenum Press, New York, 1974.
P.W. Frey and D.J. Slate. Letter recognition using Holland-style adaptive classifiers. Machine Learning, 6:161–182.
D. Levine. A parallel genetic algorithm for the set partitioning problem. Technical Report ANL-94/23, Mathematics and Computer Science Department, Argonne National Library, May 1994.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Wien
About this paper
Cite this paper
Podlena, J.R., Hendtlass, T. (1998). Using Hierarchical Genetic Populations to Improve Solution Quality. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6492-1_43
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6492-1_43
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83087-1
Online ISBN: 978-3-7091-6492-1
eBook Packages: Springer Book Archive