Optimizing strategies for slowing the spread of invasive species

IF 4.3 2区 生物学 PLoS Computational Biology Pub Date : 2024-04-01 DOI:10.1371/journal.pcbi.1011996
Adam Lampert
{"title":"Optimizing strategies for slowing the spread of invasive species","authors":"Adam Lampert","doi":"10.1371/journal.pcbi.1011996","DOIUrl":null,"url":null,"abstract":"Invasive species are spreading worldwide, causing damage to ecosystems, biodiversity, agriculture, and human health. A major question is, therefore, how to distribute treatment efforts cost-effectively across space and time to prevent or slow the spread of invasive species. However, finding optimal control strategies for the complex spatial-temporal dynamics of populations is complicated and requires novel methodologies. Here, we develop a novel algorithm that can be applied to various population models. The algorithm finds the optimal spatial distribution of treatment efforts and the optimal propagation speed of the target species. We apply the algorithm to examine how the results depend on the species’ demography and response to the treatment method. In particular, we analyze (1) a generic model and (2) a detailed model for the management of the spongy moth in North America to slow its spread via mating disruption. We show that, when utilizing optimization approaches to contain invasive species, significant improvements can be made in terms of cost-efficiency. The methodology developed here offers a much-needed tool for further examination of optimal strategies for additional cases of interest.","PeriodicalId":49688,"journal":{"name":"PLoS Computational Biology","volume":"34 ","pages":""},"PeriodicalIF":4.3000,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"PLoS Computational Biology","FirstCategoryId":"99","ListUrlMain":"https://doi.org/10.1371/journal.pcbi.1011996","RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Invasive species are spreading worldwide, causing damage to ecosystems, biodiversity, agriculture, and human health. A major question is, therefore, how to distribute treatment efforts cost-effectively across space and time to prevent or slow the spread of invasive species. However, finding optimal control strategies for the complex spatial-temporal dynamics of populations is complicated and requires novel methodologies. Here, we develop a novel algorithm that can be applied to various population models. The algorithm finds the optimal spatial distribution of treatment efforts and the optimal propagation speed of the target species. We apply the algorithm to examine how the results depend on the species’ demography and response to the treatment method. In particular, we analyze (1) a generic model and (2) a detailed model for the management of the spongy moth in North America to slow its spread via mating disruption. We show that, when utilizing optimization approaches to contain invasive species, significant improvements can be made in terms of cost-efficiency. The methodology developed here offers a much-needed tool for further examination of optimal strategies for additional cases of interest.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
优化减缓入侵物种扩散的战略
入侵物种正在全球蔓延,对生态系统、生物多样性、农业和人类健康造成破坏。因此,一个主要问题是如何在空间和时间上经济有效地分配处理工作,以防止或减缓入侵物种的扩散。然而,为复杂的种群时空动态寻找最佳控制策略非常复杂,需要新颖的方法。在此,我们开发了一种可应用于各种种群模型的新型算法。该算法能找到治疗工作的最佳空间分布和目标物种的最佳传播速度。我们应用该算法来研究结果如何取决于物种的种群结构和对处理方法的反应。特别是,我们分析了(1)一个通用模型和(2)一个管理北美海绵蛾的详细模型,以通过破坏交配来减缓其传播速度。我们的研究表明,在利用优化方法控制入侵物种时,可以显著提高成本效益。本文所开发的方法为进一步研究其他相关案例的优化策略提供了亟需的工具。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
PLoS Computational Biology
PLoS Computational Biology 生物-生化研究方法
CiteScore
7.10
自引率
4.70%
发文量
820
期刊介绍: PLOS Computational Biology features works of exceptional significance that further our understanding of living systems at all scales—from molecules and cells, to patient populations and ecosystems—through the application of computational methods. Readers include life and computational scientists, who can take the important findings presented here to the next level of discovery. Research articles must be declared as belonging to a relevant section. More information about the sections can be found in the submission guidelines. Research articles should model aspects of biological systems, demonstrate both methodological and scientific novelty, and provide profound new biological insights. Generally, reliability and significance of biological discovery through computation should be validated and enriched by experimental studies. Inclusion of experimental validation is not required for publication, but should be referenced where possible. Inclusion of experimental validation of a modest biological discovery through computation does not render a manuscript suitable for PLOS Computational Biology. Research articles specifically designated as Methods papers should describe outstanding methods of exceptional importance that have been shown, or have the promise to provide new biological insights. The method must already be widely adopted, or have the promise of wide adoption by a broad community of users. Enhancements to existing published methods will only be considered if those enhancements bring exceptional new capabilities.
期刊最新文献
Real-time forecasting of COVID-19-related hospital strain in France using a non-Markovian mechanistic model. Ten simple rules for teaching an introduction to R Evolutionary analyses of intrinsically disordered regions reveal widespread signals of conservation. A weak coupling mechanism for the early steps of the recovery stroke of myosin VI: A free energy simulation and string method analysis. Validity conditions of approximations for a target-mediated drug disposition model: A novel first-order approximation and its comparison to other approximations.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1