IDEAS home Printed from https://ideas.repec.org/a/plo/pntd00/0008096.html
   My bibliography  Save this article

Quantifying geographic accessibility to improve efficiency of entomological monitoring

Author

Listed:
  • Joshua Longbottom
  • Ana Krause
  • Stephen J Torr
  • Michelle C Stanton

Abstract

Background: Vector-borne diseases are important causes of mortality and morbidity in humans and livestock, particularly for poorer communities and countries in the tropics. Large-scale programs against these diseases, for example malaria, dengue and African trypanosomiasis, include vector control, and assessing the impact of this intervention requires frequent and extensive monitoring of disease vector abundance. Such monitoring can be expensive, especially in the later stages of a successful program where numbers of vectors and cases are low. Methodology/Principal findings: We developed a system that allows the identification of monitoring sites where pre-intervention densities of vectors are predicted to be high, and travel cost to sites is low, highlighting the most efficient locations for longitudinal monitoring. Using remotely sensed imagery and an image classification algorithm, we mapped landscape resistance associated with on- and off-road travel for every gridded location (3m and 0.5m grid cells) within Koboko district, Uganda. We combine the accessibility surface with pre-existing estimates of tsetse abundance and propose a stratified sampling approach to determine the most efficient locations for longitudinal data collection. Our modelled predictions were validated against empirical measurements of travel-time and existing maps of road networks. We applied this approach in northern Uganda where a large-scale vector control program is being implemented to control human African trypanosomiasis, a neglected tropical disease (NTD) caused by trypanosomes transmitted by tsetse flies. Our accessibility surfaces indicate a high performance when compared to empirical data, with remote sensing identifying a further ~70% of roads than existing networks. Conclusions/Significance: By integrating such estimates with predictions of tsetse abundance, we propose a methodology to determine the optimal placement of sentinel monitoring sites for evaluating control programme efficacy, moving from a nuanced, ad-hoc approach incorporating intuition, knowledge of vector ecology and local knowledge of geographic accessibility, to a reproducible, quantifiable one. Author summary: Assessing the impact of vector control programmes requires longitudinal measurements of the abundance of insect vectors within intervention areas. Such monitoring can be expensive, especially in the later stages of a successful program where numbers of vectors and cases of disease are low. Efficient monitoring involves a prior selection of monitoring sites that are easy to reach and produce rich information on vector abundance. Here, we used image classification and cost-distance algorithms to produce estimates of accessibility within Koboko district, Uganda, where vector control is contributing to the elimination of sleeping sickness, a neglected tropical disease (NTD). We combine an accessibility surface with pre-existing estimates of tsetse abundance and propose a stratified sampling approach to determine locations which are associated with low cost (lowest travel time) and potential for longitudinal data collection (high pre-intervention abundance). Our method could be adapted for use in the planning and monitoring of tsetse- and other vector-control programmes. By providing methods to ensure that vector control programmes operate at maximum efficiency, we can ensure that the limited funding associated with some of these NTDs has the largest impact.

Suggested Citation

  • Joshua Longbottom & Ana Krause & Stephen J Torr & Michelle C Stanton, 2020. "Quantifying geographic accessibility to improve efficiency of entomological monitoring," PLOS Neglected Tropical Diseases, Public Library of Science, vol. 14(3), pages 1-19, March.
  • Handle: RePEc:plo:pntd00:0008096
    DOI: 10.1371/journal.pntd.0008096
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosntds/article?id=10.1371/journal.pntd.0008096
    Download Restriction: no

    File URL: https://journals.plos.org/plosntds/article/file?id=10.1371/journal.pntd.0008096&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pntd.0008096?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. David Applegate & William Cook & André Rohe, 2003. "Chained Lin-Kernighan for Large Traveling Salesman Problems," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 82-92, February.
    2. Neil M. Ferguson, 2018. "Challenges and opportunities in controlling mosquito-borne infections," Nature, Nature, vol. 559(7715), pages 490-497, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Fatih Rahim & Canan Sepil, 2014. "A location-routing problem in glass recycling," Annals of Operations Research, Springer, vol. 223(1), pages 329-353, December.
    2. Taillard, Éric D., 2022. "A linearithmic heuristic for the travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 297(2), pages 442-450.
    3. Andrzej Jaszkiewicz & Thibaut Lust, 2017. "Proper balance between search towards and along Pareto front: biobjective TSP case study," Annals of Operations Research, Springer, vol. 254(1), pages 111-130, July.
    4. Taillard, Éric D. & Helsgaun, Keld, 2019. "POPMUSIC for the travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 272(2), pages 420-429.
    5. Gary R. Waissi & Pragya Kaushal, 2020. "A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 73-87, March.
    6. Polyakovskiy, S. & Neumann, F., 2017. "The Packing While Traveling Problem," European Journal of Operational Research, Elsevier, vol. 258(2), pages 424-439.
    7. Baniasadi, Pouya & Foumani, Mehdi & Smith-Miles, Kate & Ejov, Vladimir, 2020. "A transformation technique for the clustered generalized traveling salesman problem with applications to logistics," European Journal of Operational Research, Elsevier, vol. 285(2), pages 444-457.
    8. Sebastian Herrmann & Gabriela Ochoa & Franz Rothlauf, 2016. "Communities of Local Optima as Funnels in Fitness Landscapes," Working Papers 1609, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    9. César Rego & Fred Glover, 2010. "Ejection chain and filter-and-fan methods in combinatorial optimization," Annals of Operations Research, Springer, vol. 175(1), pages 77-105, March.
    10. Çavdar, Bahar & Sokol, Joel, 2015. "TSP Race: Minimizing completion time in time-sensitive applications," European Journal of Operational Research, Elsevier, vol. 244(1), pages 47-54.
    11. Weizhe Chen & Jialiang Guo & Yiran Liu & Jackson Champer, 2024. "Population suppression by release of insects carrying a dominant sterile homing gene drive targeting doublesex in Drosophila," Nature Communications, Nature, vol. 15(1), pages 1-13, December.
    12. Markus Wagner & Marius Lindauer & Mustafa Mısır & Samadhi Nallaperuma & Frank Hutter, 2018. "A case study of algorithm selection for the traveling thief problem," Journal of Heuristics, Springer, vol. 24(3), pages 295-320, June.
    13. Elena Nechita & Gloria Cerasela Crişan & Laszlo Barna Iantovics & Yitong Huang, 2020. "On the Resilience of Ant Algorithms. Experiment with Adapted MMAS on TSP," Mathematics, MDPI, vol. 8(5), pages 1-20, May.
    14. Edoardo Fadda & Luca Gobbato & Guido Perboli & Mariangela Rosano & Roberto Tadei, 2018. "Waste Collection in Urban Areas: A Case Study," Interfaces, INFORMS, vol. 48(4), pages 307-322, August.
    15. Yuichi Nagata & Shigenobu Kobayashi, 2013. "A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 346-363, May.
    16. repec:jss:jstsof:23:i02 is not listed on IDEAS
    17. Zhihui Li & Jin Wang & Xiaomin Cheng & Huan Hu & Cheng Guo & Jingyi Huang & Zeliang Chen & Jiahai Lu, 2021. "The worldwide seroprevalence of DENV, CHIKV and ZIKV infection: A systematic review and meta-analysis," PLOS Neglected Tropical Diseases, Public Library of Science, vol. 15(4), pages 1-17, April.
    18. William Cook & Paul Seymour, 2003. "Tour Merging via Branch-Decomposition," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 233-248, August.
    19. Sebastian Herrmann & Gabriela Ochoa & Franz Rothlauf, 2018. "PageRank centrality for performance prediction: the impact of the local optima network model," Journal of Heuristics, Springer, vol. 24(3), pages 243-264, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pntd00:0008096. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosntds (email available below). General contact details of provider: https://journals.plos.org/plosntds/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.