Selection and Penalty Strategies for Genetic Algorithms Designed to Solve Spatial Forest Planning Problems

الملخص EN

Genetic algorithms (GAs) have demonstrated success in solving spatial forest planning problems.

We present an adaptive GA that incorporates population-level statistics to dynamically update penalty functions, a process analogous to strategic oscillation from the tabu search literature.

We also explore performance of various selection strategies.

The GA identified feasible solutions within 96%, 98%, and 93% of a nonspatial relaxed upper bound calculated for landscapes of 100, 500, and 1000 units, respectively.

The problem solved includes forest structure constraints limiting harvest opening sizes and requiring minimally sized patches of mature forest.

Results suggest that the dynamic penalty strategy is superior to the more standard static penalty implementation.

Results also suggest that tournament selection can be superior to the more standard implementation of proportional selection for smaller problems, but becomes susceptible to premature convergence as problem size increases.

It is therefore important to balance selection pressure with appropriate disruption.

We conclude that integrating intelligent search strategies into the context of genetic algorithms can yield improvements and should be investigated for future use in spatial planning with ecological goals.