Uma busca pelo desenho amostral ótimo no problema de redução de malha amostral utilizando algoritmos genéticos: aplicado ao sistema de ovitrampas da cidade do Rio de Janeiro

• Autor(a) principal: Costa, Leonardo Rodrigues Mattos da
• Data de Publicação: 2016
• Tipo de documento: Dissertação
• Idioma: por
• Título da fonte: Repositório Institucional do FGV (FGV Repositório Digital)
• Texto Completo: http://hdl.handle.net/10438/16982
• topic: Sampling grid reduction; Genetic algorithms; Qcombinatorial optimization; Algoritmos genéticos; Otimização combinatória; Redução de malha amostral; Matemática; Otimização combinatória; Algoritmos genéticos

Concerns about the spread of disease affect both the population in their daily life and public health policy in Brazil and worldwide. The Brazilian Ministry of Health estimates that 2.5 billion people across the globe live in regions where dengue fever is an endemic disease, and approximately 50 million people are infected each year. In Brazil, new disease outbreaks occur every 3 to 5 years, generally associated with the introduction of a new serotype in the country. The last outbreak occurred in 2013 with the introduction of the so-called type-4 dengue virus. Surveillance of mosquito reproduction and infestation includes, among other methods, the use of "ovitraps" – traps where mosquitoes lay their eggs, which are considered one the best alternatives for detecting dengue and yellow fever outbreaks. The aim of this study is to reduce the sample size of the system for capturing dengue mosquito eggs used by the city of Rio de Janeiro. With this, it will be possible to increase the frequency of data collection from a monthly to a weekly basis without increasing costs, while maintaining the quality of estimates obtained from the sample. The sampling grid reduction problem is associated with a combinatorial optimization problem belonging to the NP class where, given a sample of size n, a subset of elements of size n* needs to be found such that the estimation error is less a preset limit. From this definition, it is possible to turn the sample reduction problem into a case of the 0/1 knapsack problem. Using this association, this paper proposes objective functions that incorporate spatio-temporal dependence effects as well as an approach using biased random-key genetic algorithms