森林灭火资源布置的稳健优化方法

IF 3.1 4区 管理学 Q2 MANAGEMENT
André Bergsten Mendes, Filipe Pereira e Alvelos
{"title":"森林灭火资源布置的稳健优化方法","authors":"André Bergsten Mendes, Filipe Pereira e Alvelos","doi":"10.1111/itor.13524","DOIUrl":null,"url":null,"abstract":"This research develops an initial attack plan for combating forest fires in any wildland areas susceptible to fire outbreaks. To be eligible for such a plan, the landscape must have been previously mapped and modelled concerning spatial and topographic data and fuel levels. Thus, when ignition occurs, one can predict the expected fire behaviour in terms of spread direction and rate of spread. With such information, decisions can be taken on where and when to position the suppression resources. This paper extends a recent contribution to this subject, generalising each node's resource requirement, allowing a more precise modelling of non‐homogeneous landscapes. Moreover, we treat the cases where the estimated number of resources may not be sufficient to deal with the fire intensity, which becomes revealed only at the fire scene. In such cases, additional resources may be needed to contain the fire effectively. This worst‐case approach is modelled with the support of the robust optimisation paradigm. We propose a deterministic mathematical programming model, a robust optimisation counterpart, and a robust tabu search (RoTS) algorithm. We adapt instances from the literature, which are optimally solved by a commercial solver and used for assessing the quality of the RoTS. The proposed algorithm could optimally solve 94 of 96 instances. Finally, we conducted a Monte Carlo simulation as part of a risk analysis assessment of the generated solutions.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"256 1","pages":""},"PeriodicalIF":3.1000,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A robust optimisation approach for the placement of forest fire suppression resources\",\"authors\":\"André Bergsten Mendes, Filipe Pereira e Alvelos\",\"doi\":\"10.1111/itor.13524\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This research develops an initial attack plan for combating forest fires in any wildland areas susceptible to fire outbreaks. To be eligible for such a plan, the landscape must have been previously mapped and modelled concerning spatial and topographic data and fuel levels. Thus, when ignition occurs, one can predict the expected fire behaviour in terms of spread direction and rate of spread. With such information, decisions can be taken on where and when to position the suppression resources. This paper extends a recent contribution to this subject, generalising each node's resource requirement, allowing a more precise modelling of non‐homogeneous landscapes. Moreover, we treat the cases where the estimated number of resources may not be sufficient to deal with the fire intensity, which becomes revealed only at the fire scene. In such cases, additional resources may be needed to contain the fire effectively. This worst‐case approach is modelled with the support of the robust optimisation paradigm. We propose a deterministic mathematical programming model, a robust optimisation counterpart, and a robust tabu search (RoTS) algorithm. We adapt instances from the literature, which are optimally solved by a commercial solver and used for assessing the quality of the RoTS. The proposed algorithm could optimally solve 94 of 96 instances. Finally, we conducted a Monte Carlo simulation as part of a risk analysis assessment of the generated solutions.\",\"PeriodicalId\":49176,\"journal\":{\"name\":\"International Transactions in Operational Research\",\"volume\":\"256 1\",\"pages\":\"\"},\"PeriodicalIF\":3.1000,\"publicationDate\":\"2024-08-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Transactions in Operational Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1111/itor.13524\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MANAGEMENT\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Transactions in Operational Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1111/itor.13524","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0

摘要

这项研究为在任何容易爆发火灾的荒地地区扑灭森林火灾制定了初始攻击计划。要制定这样的计划,必须事先绘制地形图,并对空间和地形数据以及燃料水平进行建模。这样,当发生火灾时,就可以预测火灾在蔓延方向和蔓延速度方面的预期行为。有了这些信息,就可以决定在何时何地部署灭火资源。本文扩展了最近对这一主题的贡献,概括了每个节点的资源需求,从而可以更精确地模拟非均质地貌。此外,我们还讨论了估计的资源数量可能不足以应对火灾强度的情况,因为火灾强度只有在火灾现场才会显现出来。在这种情况下,可能需要额外的资源来有效控制火势。在稳健优化范例的支持下,我们对这种最坏情况下的方法进行了建模。我们提出了一个确定性数学编程模型、一个稳健优化对应模型和一个稳健塔布搜索(RoTS)算法。我们调整了文献中的实例,由商业求解器进行优化求解,并用于评估 RoTS 的质量。在 96 个实例中,所提出的算法可以优化解决 94 个。最后,我们进行了蒙特卡罗模拟,作为对生成的解决方案进行风险分析评估的一部分。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A robust optimisation approach for the placement of forest fire suppression resources
This research develops an initial attack plan for combating forest fires in any wildland areas susceptible to fire outbreaks. To be eligible for such a plan, the landscape must have been previously mapped and modelled concerning spatial and topographic data and fuel levels. Thus, when ignition occurs, one can predict the expected fire behaviour in terms of spread direction and rate of spread. With such information, decisions can be taken on where and when to position the suppression resources. This paper extends a recent contribution to this subject, generalising each node's resource requirement, allowing a more precise modelling of non‐homogeneous landscapes. Moreover, we treat the cases where the estimated number of resources may not be sufficient to deal with the fire intensity, which becomes revealed only at the fire scene. In such cases, additional resources may be needed to contain the fire effectively. This worst‐case approach is modelled with the support of the robust optimisation paradigm. We propose a deterministic mathematical programming model, a robust optimisation counterpart, and a robust tabu search (RoTS) algorithm. We adapt instances from the literature, which are optimally solved by a commercial solver and used for assessing the quality of the RoTS. The proposed algorithm could optimally solve 94 of 96 instances. Finally, we conducted a Monte Carlo simulation as part of a risk analysis assessment of the generated solutions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Transactions in Operational Research
International Transactions in Operational Research OPERATIONS RESEARCH & MANAGEMENT SCIENCE-
CiteScore
7.80
自引率
12.90%
发文量
146
审稿时长
>12 weeks
期刊介绍: International Transactions in Operational Research (ITOR) aims to advance the understanding and practice of Operational Research (OR) and Management Science internationally. Its scope includes: International problems, such as those of fisheries management, environmental issues, and global competitiveness International work done by major OR figures Studies of worldwide interest from nations with emerging OR communities National or regional OR work which has the potential for application in other nations Technical developments of international interest Specific organizational examples that can be applied in other countries National and international presentations of transnational interest Broadly relevant professional issues, such as those of ethics and practice Applications relevant to global industries, such as operations management, manufacturing, and logistics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信