Current issue: 53(3)

Under compilation: 53(4)

Impact factor 1.683
5-year impact factor 1.950
Silva Fennica 1926-1997
1990-1997
1980-1989
1970-1979
1960-1969
Acta Forestalia Fennica
1953-1968
1933-1952
1913-1932

Articles containing the keyword 'genetic algorithms'.

Category: Research article

article id 299, category Research article
Hongcheng Zeng, Timo Pukkala, Heli Peltola, Seppo Kellomäki. (2007). Application of ant colony optimization for the risk management of wind damage in forest planning. Silva Fennica vol. 41 no. 2 article id 299. https://doi.org/10.14214/sf.299
Ant colony optimization (ACO) is still quite a new technique and seldom used in the field of forest planning compared to other heuristics such as simulated annealing and genetic algorithms. This work was aimed at evaluating the suitability of ACO for optimizing the clear-cut patterns of a forest landscape when aiming at simultaneously minimizing the risk of wind damage and maintaining sustainable and even flow of periodical harvests. For this purpose, the ACO was first revised and the algorithm was coded using the Visual Basic Application of the ArcGIS software. Thereafter, the performance of the modified ACO was demonstrated in a forest located in central Finland using a 30-year planning period. Its performance was compared to simulated annealing and a genetic algorithm. The revised ACO performed logically since the objective function value was improving and the algorithm was converging during the optimization process. The solutions maintained a quite even periodical harvesting timber while minimizing the risk of wind damage. Implementing the solution would result in smooth landscape in terms of stand height after the 30-year planning period. The algorithm is quite sensitive to the parameters controlling pheromone updating and schedule selecting. It is comparable in solution quality to simulated annealing and genetic algorithms.
  • Zeng, University of Joensuu, Faculty of Forest Sciences, P. O. Box 111, FI-80101 Joensuu, Finland ORCID ID:E-mail: hongcheng.zeng@joensuu.fi (email)
  • Pukkala, University of Joensuu, Faculty of Forest Sciences, P. O. Box 111, FI-80101 Joensuu, Finland ORCID ID:E-mail:
  • Peltola, University of Joensuu, Faculty of Forest Sciences, P. O. Box 111, FI-80101 Joensuu, Finland ORCID ID:E-mail:
  • Kellomäki, University of Joensuu, Faculty of Forest Sciences, P. O. Box 111, FI-80101 Joensuu, Finland ORCID ID:E-mail:
article id 396, category Research article
Timo Pukkala, Mikko Kurttila. (2005). Examining the performance of six heuristic optimisation techniques in different forest planning problems. Silva Fennica vol. 39 no. 1 article id 396. https://doi.org/10.14214/sf.396
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.
  • Pukkala, University of Joensuu, Faculty of Forestry, P.O. BOX 111, FI-80101 Joensuu, Finland ORCID ID:E-mail: timo.pukkala@forest.joensuu.fi (email)
  • Kurttila, Finnish Forest Research Institute, Joensuu Research Centre, P.O. Box 68, FI-80101 Joensuu, Finland ORCID ID:E-mail:

Register
Click this link to register for Silva Fennica submission and tracking system.
Log in
If you are a registered user, log in to save your selected articles for later access.
Contents alert
Sign up to receive alerts of new content
Your selected articles

Committee on Publication Ethics A Trusted Community-Governed Archive