No abstract

No abstract

No abstract

No abstract

No abstract

No abstract

The existence of multiple decision-makers and goals, spatial and non-linear forest management objectives and the combinatorial nature of forest planning problems are reasons that support the use of heuristic optimisation algorithms in forest planning instead of the more traditional LP methods. A heuristic is a search algorithm that does not necessarily find the global optimum but it can produce relatively good solutions within reasonable time. The performance of different heuristics may vary depending on the complexity of the planning problem. This study tested six heuristic optimisation techniques in five different, increasingly difficult planning problems. The heuristics were evaluated with respect to the objective function value that the techniques were able to find, and the time they consumed in the optimisation process. The tested optimisation techniques were 1) random ascent (RA), 2) Hero sequential ascent technique (Hero), 3) simulated annealing (SA), 4) a hybrid of SA and Hero (SA+Hero), 5) tabu search (TS) and 6) genetic algorithm (GA). The results, calculated as averages of 100 repeated optimisations, were very similar for all heuristics with respect to the objective function value but the time consumption of the heuristics varied considerably. During the time the slowest techniques (SA or GA) required for convergence, the optimisation could have been repeated about 200 times with the fastest technique (Hero). The SA+Hero and SA techniques found the best solutions for non-spatial planning problems, while GA was the best in the most difficult problems. The results suggest that, especially in spatial planning problems, it is a benefit if the method performs more complicated moves than selecting one of the neighbouring solutions. It may also be beneficial to combine two or more heuristic techniques.

No abstract