Optimisation algorithms for spatially constrained forest planning

Optimisation algorithms for spatially constrained forest planning

0.00 Avg rating0 Votes
Article ID: iaor2009434
Country: Netherlands
Volume: 194
Issue: 4
Start Page Number: 421
End Page Number: 428
Publication Date: Apr 2006
Journal: Ecological Modelling
Authors: , , , , ,
Keywords: location, heuristics: genetic algorithms, optimization: simulated annealing
Abstract:

We compared genetic algorithms, simulated annealing and hill climbing algorithms on spatially constrained, integrated forest planning problems. There has been growing interest in algorithms that mimic natural processes, such as genetic algorithms and simulated annealing. These algorithms use random moves to generate new solutions, and employ a probabilistic acceptance/rejection criterion that allows inferior moves within the search space. Algorithms for a genetic algorithm, simulated annealing, and random hill climbing are formulated and tested on a same-sample forest-planning problem where the adjacency rule is strictly enforced.

Reviews

Required fields are marked *. Your email address will not be published.