2022
DOI: 10.3390/math10030300
|View full text |Cite
|
Sign up to set email alerts
|

A Review of Genetic Algorithm Approaches for Wildfire Spread Prediction Calibration

Abstract: Wildfires are complex natural events that cause significant environmental and property damage, as well as human losses, every year throughout the world. In order to aid in their management and mitigate their impact, efforts have been directed towards developing decision support systems that can predict wildfire propagation. Most of the available tools for wildfire spread prediction are based on the Rothermel model that, apart from being relatively complex and computing demanding, depends on several input param… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 37 publications
(12 citation statements)
references
References 40 publications
0
12
0
Order By: Relevance
“…Optimal values for these parameters must be judiciously adjusted, considering the specific characteristics of the population. Genetic algorithms involve a dynamic process, and parameter tuning is essential for achieving optimal results [55,56].…”
Section: Evolution Parametersmentioning
confidence: 99%
“…Optimal values for these parameters must be judiciously adjusted, considering the specific characteristics of the population. Genetic algorithms involve a dynamic process, and parameter tuning is essential for achieving optimal results [55,56].…”
Section: Evolution Parametersmentioning
confidence: 99%
“…It should be noted that the choice of using GA and CW to compose the optimization model to obtain better routes was because both algorithms have shown good results for routing problems and other related combinatorial optimization problems. Nevertheless, the use of heuristics to populate the initial GA population with feasible solutions has proven to be a good alternative for solving routing problems [34,[41][42][43]. In addition, we tested other metaheuristics such as Simulated Annealing-SA [44][45][46] and Tabu Search-TS [45,46], but the results obtained in preliminary experiments do not indicate improvements in using them.…”
Section: Proposed Ai-based Approach For Economic and Environmental As...mentioning
confidence: 99%
“…It selects individuals with high fitness degrees as the operational objectives in the next iteration. The population is evolved/transformed during several generations in order to obtain a final population that contains individuals with the best possible quality for the problem at hand [42].…”
Section: Ga and Pso Algorithmmentioning
confidence: 99%