Matheuristic approaches for multi-visit drone routing problem to prevent forest fires

Basit Öğe Kaydı
dc.authorid0000-0002-8758-2407
dc.authorid0000-0002-3839-2754
dc.contributor.authorTukenmez, Ilknur
dc.contributor.authorOzkan, Omer
dc.date.accessioned2026-02-08T15:15:18Z
dc.date.available2026-02-08T15:15:18Z
dc.date.issued2024
dc.departmentBursa Teknik Üniversitesi
dc.description.abstractForest fires draw more attention as the impact of elements that threaten nature increases, such as the thinning of the ozone layer, and global warming. The prevention of forest fires is extremely important for the protection of natural life, and the provision of a healthy world to future generations. Some of the methods used for the prevention of forest fires are observation towers, unmanned aerial vehicles, images taken from satellites, and detectors. Noticing the fire as soon as it starts and intervening in the fire prevents the fire from spreading and causing major and negative consequences. The degree of fire sensitivity of forest areas may vary depending on factors such as the climate of the region, topographic structure, humidity ratio, vegetation, tree species, and density. Observing regions with high fire sensitivity more frequently than regions with low fire sensitivity will prevent the spread of fires faster by detecting them. Different from the literature, in this study, the degree of sensitivity of fire-sensitive areas are taken into account. Visit frequency is determined according to the degree of fire sensitivity. Due to the complexity of the constraints, the mathematical model can not reach the optimal solution in a short time. To solve larger problem decomposition based matheuristic approaches are proposed. Matheuristic algorithms are compared using different parameters for samples of different sizes.
dc.identifier.doi10.1016/j.ijdrr.2024.104776
dc.identifier.issn2212-4209
dc.identifier.scopus2-s2.0-85202063920
dc.identifier.scopusqualityQ1
dc.identifier.urihttps://doi.org/10.1016/j.ijdrr.2024.104776
dc.identifier.urihttps://hdl.handle.net/20.500.12885/5692
dc.identifier.volume112
dc.identifier.wosWOS:001302263200001
dc.identifier.wosqualityQ1
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherElsevier
dc.relation.ispartofInternational Journal of Disaster Risk Reduction
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzWOS_KA_20260207
dc.subjectDrone routing problem
dc.subjectForest fire
dc.subjectMatheuristic algorithm
dc.subjectFire detection
dc.titleMatheuristic approaches for multi-visit drone routing problem to prevent forest fires
dc.typeArticle

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu