森林火灾监测中无人机路径问题的弯曲分解数学集成

IF 6.7 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
İhsan Sadati
{"title":"森林火灾监测中无人机路径问题的弯曲分解数学集成","authors":"İhsan Sadati","doi":"10.1016/j.cie.2025.111087","DOIUrl":null,"url":null,"abstract":"<div><div>Wildfires annually cause extensive and immeasurable harm to the environment, incurring significant costs for containment efforts. Early detection plays a crucial role in preventing the escalation of wildfires, requiring accurate and frequent updates on images and information. Despite advancements in detection methods utilizing image processing and satellite monitoring, the demand for improved precision and frequency persists. Presently, satellite images can detect fires as small as 0.1 ha with an accuracy of 1 km. While helicopters offer detailed information, their use is both hazardous and expensive. There is growing interest in Unmanned Aerial Vehicles (UAVs) for wildfire detection due to their ability to quickly cover potential fire areas using high-definition and thermal infrared cameras, particularly in remote and hazardous terrains. This study addresses the routing and scheduling of UAVs for forest fire surveillance. A mixed-integer linear programming (MILP) model is formulated, followed by the introduction of matheuristic approaches to tackle and solve the problem, drawing inspiration from variable neighborhood search. Matheuristics, which integrate mathematical programming techniques and heuristics, provide efficient optimization methods. Additionally, we incorporate Benders Decomposition to enhance the optimization process by decomposing the problem into a master problem and a subproblem, allowing for more effective exploration of feasible solutions. To evaluate the effectiveness of our proposed solution approach, computational experiments are conducted using a set of instances generated from the Covering Vehicle Routing Problem (CoVRP) and Electric Vehicle Routing Problem (EVRP) datasets. The results indicate that our proposed matheuristics approach, augmented by Benders Decomposition, is capable of producing high-quality solutions. Furthermore, a case study is presented focusing on the Belgrade Forest, one of the largest forests in Istanbul, Turkey, to underscore the benefits of utilizing UAVs in forest fire surveillance.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"204 ","pages":"Article 111087"},"PeriodicalIF":6.7000,"publicationDate":"2025-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An efficient matheuristic integration with benders decomposition for unmanned aerial vehicle routing problem in forest fire surveillance\",\"authors\":\"İhsan Sadati\",\"doi\":\"10.1016/j.cie.2025.111087\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Wildfires annually cause extensive and immeasurable harm to the environment, incurring significant costs for containment efforts. Early detection plays a crucial role in preventing the escalation of wildfires, requiring accurate and frequent updates on images and information. Despite advancements in detection methods utilizing image processing and satellite monitoring, the demand for improved precision and frequency persists. Presently, satellite images can detect fires as small as 0.1 ha with an accuracy of 1 km. While helicopters offer detailed information, their use is both hazardous and expensive. There is growing interest in Unmanned Aerial Vehicles (UAVs) for wildfire detection due to their ability to quickly cover potential fire areas using high-definition and thermal infrared cameras, particularly in remote and hazardous terrains. This study addresses the routing and scheduling of UAVs for forest fire surveillance. A mixed-integer linear programming (MILP) model is formulated, followed by the introduction of matheuristic approaches to tackle and solve the problem, drawing inspiration from variable neighborhood search. Matheuristics, which integrate mathematical programming techniques and heuristics, provide efficient optimization methods. Additionally, we incorporate Benders Decomposition to enhance the optimization process by decomposing the problem into a master problem and a subproblem, allowing for more effective exploration of feasible solutions. To evaluate the effectiveness of our proposed solution approach, computational experiments are conducted using a set of instances generated from the Covering Vehicle Routing Problem (CoVRP) and Electric Vehicle Routing Problem (EVRP) datasets. The results indicate that our proposed matheuristics approach, augmented by Benders Decomposition, is capable of producing high-quality solutions. Furthermore, a case study is presented focusing on the Belgrade Forest, one of the largest forests in Istanbul, Turkey, to underscore the benefits of utilizing UAVs in forest fire surveillance.</div></div>\",\"PeriodicalId\":55220,\"journal\":{\"name\":\"Computers & Industrial Engineering\",\"volume\":\"204 \",\"pages\":\"Article 111087\"},\"PeriodicalIF\":6.7000,\"publicationDate\":\"2025-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Industrial Engineering\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0360835225002335\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Industrial Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0360835225002335","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

野火每年都会对环境造成广泛和无法估量的危害,并为遏制工作带来巨大成本。早期探测在防止野火升级方面发挥着至关重要的作用,这就需要准确、频繁地更新图像和信息。尽管利用图像处理和卫星监测的探测方法取得了进步,但对提高精确度和频率的需求依然存在。目前,卫星图像可以探测到小至 0.1 公顷的火灾,精确度为 1 公里。虽然直升机可以提供详细的信息,但其使用既危险又昂贵。无人驾驶飞行器(UAV)能够使用高清晰度和热红外摄像机快速覆盖潜在的火灾区域,尤其是在偏远和危险的地形中,因此人们对无人驾驶飞行器(UAV)用于野火探测的兴趣与日俱增。本研究探讨了用于森林火灾监控的无人机的路由和调度问题。首先建立了一个混合整数线性规划(MILP)模型,然后从变量邻域搜索中汲取灵感,引入数理方法来处理和解决该问题。数学启发式将数学编程技术与启发式相结合,提供了高效的优化方法。此外,我们还采用了本德斯分解法(Benders Decomposition),通过将问题分解成主问题和子问题来增强优化过程,从而更有效地探索可行的解决方案。为了评估我们提出的解决方法的有效性,我们使用从覆盖车辆路由问题(CoVRP)和电动车辆路由问题(EVRP)数据集生成的一组实例进行了计算实验。结果表明,我们所提出的经本德斯分解(Benders Decomposition)增强的数学启发式方法能够产生高质量的解决方案。此外,我们还介绍了贝尔格莱德森林(土耳其伊斯坦布尔最大的森林之一)的案例研究,以强调在森林火灾监控中使用无人机的益处。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An efficient matheuristic integration with benders decomposition for unmanned aerial vehicle routing problem in forest fire surveillance
Wildfires annually cause extensive and immeasurable harm to the environment, incurring significant costs for containment efforts. Early detection plays a crucial role in preventing the escalation of wildfires, requiring accurate and frequent updates on images and information. Despite advancements in detection methods utilizing image processing and satellite monitoring, the demand for improved precision and frequency persists. Presently, satellite images can detect fires as small as 0.1 ha with an accuracy of 1 km. While helicopters offer detailed information, their use is both hazardous and expensive. There is growing interest in Unmanned Aerial Vehicles (UAVs) for wildfire detection due to their ability to quickly cover potential fire areas using high-definition and thermal infrared cameras, particularly in remote and hazardous terrains. This study addresses the routing and scheduling of UAVs for forest fire surveillance. A mixed-integer linear programming (MILP) model is formulated, followed by the introduction of matheuristic approaches to tackle and solve the problem, drawing inspiration from variable neighborhood search. Matheuristics, which integrate mathematical programming techniques and heuristics, provide efficient optimization methods. Additionally, we incorporate Benders Decomposition to enhance the optimization process by decomposing the problem into a master problem and a subproblem, allowing for more effective exploration of feasible solutions. To evaluate the effectiveness of our proposed solution approach, computational experiments are conducted using a set of instances generated from the Covering Vehicle Routing Problem (CoVRP) and Electric Vehicle Routing Problem (EVRP) datasets. The results indicate that our proposed matheuristics approach, augmented by Benders Decomposition, is capable of producing high-quality solutions. Furthermore, a case study is presented focusing on the Belgrade Forest, one of the largest forests in Istanbul, Turkey, to underscore the benefits of utilizing UAVs in forest fire surveillance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computers & Industrial Engineering
Computers & Industrial Engineering 工程技术-工程:工业
CiteScore
12.70
自引率
12.70%
发文量
794
审稿时长
10.6 months
期刊介绍: Computers & Industrial Engineering (CAIE) is dedicated to researchers, educators, and practitioners in industrial engineering and related fields. Pioneering the integration of computers in research, education, and practice, industrial engineering has evolved to make computers and electronic communication integral to its domain. CAIE publishes original contributions focusing on the development of novel computerized methodologies to address industrial engineering problems. It also highlights the applications of these methodologies to issues within the broader industrial engineering and associated communities. The journal actively encourages submissions that push the boundaries of fundamental theories and concepts in industrial engineering techniques.
×
引用
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学术官方微信