Survey Methodology
A grouping genetic algorithm for joint stratification and sample allocation designs
Archived Content
Information identified as archived is provided for reference, research or recordkeeping purposes. It is not subject to the Government of Canada Web Standards and has not been altered or updated since it was archived. Please "contact us" to request a format other than those available.
by Mervyn O’Luing, Steven Prestwich, and S. Armagan TarimNote 1
- Release date: December 17, 2019
Abstract
Finding the optimal stratification and sample size in univariate and multivariate sample design is hard when the population frame is large. There are alternative ways of modelling and solving this problem, and one of the most natural uses genetic algorithms (GA) combined with the Bethel-Chromy evaluation algorithm. The GA iteratively searches for the minimum sample size necessary to meet precision constraints in partitionings of atomic strata created by the Cartesian product of auxiliary variables. We point out a drawback with classical GAs when applied to the grouping problem, and propose a new GA approach using “grouping” genetic operators instead of traditional operators. Experiments show a significant improvement in solution quality for similar computational effort.
Key Words: Grouping genetic algorithm; Optimal stratification; Sample allocation; R software.
Table of contents
- Section 1. Introduction
- Section 2. Classical vs grouping genetic algorithms
- Section 3. Comparing the genetic algorithms
- Section 4. An improved Bethel implementation
- Section 5. Conclusion and further work
- Acknowledgements
- References
How to cite
O’Luing, M., Prestwich, S. and Tarim, S.A. (2019). A grouping genetic algorithm for joint stratification and sample allocation designs. Survey Methodology, Statistics Canada, Catalogue No. 12-001-X, Vol. 45, No. 3. Paper available at http://www.statcan.gc.ca/pub/12-001-x/2019003/article/00007-eng.htm.
Note
- Date modified: