Forest landscape management modeling using simulated annealing

https://doi.org/10.1016/S0378-1127(01)00654-5Get rights and content

Abstract

This paper presents a new landscape management model using a simulated annealing approach. The model is capable of achieving target landscape structure, in the form of composition and configuration objectives, in a near optimal fashion by spatially and temporally scheduling treatment interventions. Management objectives and constraints are identified in an objective function. Penalty cost functions for each objective establish common non-monetary units, and a mechanism for making trade-offs among different objectives. Management strategies, as well as alternative solutions as combinations of treatment scheduling of each stand, are formulated around treatment regimes, including varying intensities of planting, pre-commercial thinning, commercial thinning, two-stage harvesting and clear-cutting. The model then examines alternative solutions using a heuristic process, and evaluates their effects on the objective over an entire planning horizon.

The model was tested on a 20,000 ha (987 stands) hypothetical forest landscape with four replicates, differing in initial age class composition and spatial configuration. Management objectives included: (i) maximizing harvest volume, (ii) minimizing deviations in harvest flow, (iii) maintaining harvest block size between 40 and 100 ha, (iv) maintaining a one period adjacency delay, and (v) achieving an inverse-J distribution of harvest opening patches. Objective accomplishment, when compared to an aspatial optimal solution, varied from 72% for even flow harvest, to 99.9% for adjacency delay. These results generally reflect the objective priorities established for the test.

Results also suggested that the achievement of an inverse-J distribution of harvest opening patches depended not only upon the spatial harvest pattern, but initial forest conditions as well. In the case of the test forests, however, the effects of different initial age class structure and spatial configuration lasted a relatively short time. We conclude that simulated annealing allows a great deal of flexibility in designing landscape management in a near optimal fashion.

Introduction

Forest management design is a challenging part of the management planning process. Perhaps the most significant aspect of that challenge is developing a sound forest modeling approach that accommodates multiple, often conflicting, management objectives, such as wood supply, wildlife habitat, water quality, and biodiversity.

Multiple forest objectives are difficult to integrate in a model. Most often they do not share common measurement units and are described with different methods. Furthermore, the need in landscape management to include spatial configuration of forest conditions, as well as their aspatial composition, increases difficulty (Baskent and Jordan, 1995a). Management objectives that incorporate spatial configuration preclude using a simple forest description with an a priori stratification (Nur et al., 2000). As a result, traditional modeling approaches are inefficient and ineffective in landscape management design. Finding a better approach, however, is not straightforward.

So far, a variety of modeling approaches, involving a variety of forest descriptions and management objectives, have been developed using mathematical optimizing and simulation techniques. Simulation involves a heuristic approach whereby important lessons in forest dynamics, including configuration, may be learned on the way to finding a solution, i.e. an intervention schedule. It does not, however, produce an optimal solution due to its sequential search nature and failure to make inter-temporal trade-offs. Nor, is simulation effective where multiple management objectives exist. Landscape management, however, involves multiple objectives (composition and configuration), most of which are conflicting and spatial in nature, and often an optimal or near optimal solution is desired. Optimizing approaches, on the other hand, have the appeal of guaranteeing an optimal schedule, even where multiple objectives exist. They are almost impossible to formulate, though, where management objectives involve spatial configuration of forest conditions, as well as their composition (Murray, 1999, Nur et al., 2000). While some relaxed optimization techniques, such as integer or mixed integer programming (MIP), have been used in accommodating spatial constraints, such as block size and adjacency delay (Nelson and Brodie, 1990, Hof et al., 1994), MIP has shown little promise in solving real problems in a reasonable time (Kirby et al., 1986, Bettinger et al., 1999). Several limitations, directly related to problem size and the non-linear nature of configuration objectives (Lockwood and Moore, 1993, Bettinger et al., 1998, Murray, 1999) limit the utility of MIP approaches. For example, Bettinger et al. (1999) used MIP to solve a simple 700-unit management problem with a single harvest choice over five periods, but failed to obtain a feasible solution in a reasonable time—it took several days to reach an optimal solution for even a 40-unit, hypothetical management problem. Optimization techniques do not look promising where configurational objectives, such as patch size distribution, are involved, even in a relatively small management problem. Perhaps, that explains why no studies to date have shown a mathematical formulation involving patch size and distribution objectives.

Neither simulation nor mathematical optimizing approaches are capable of solving the forest landscape management design problem. A new approach is needed. Like other types of combinatorial optimization techniques, such as hill climbing and tabu search (Yoshimoto et al., 1994, Murray and Church, 1995, Bettinger et al., 1998) simulated annealing (Kirkpatrick, 1984) is such an approach (Lockwood and Moore, 1993, Murray and Church, 1995, Ohman and Eriksson, 1998). It is a modified simulation approach that uses a smart search technique to find the best combination of management interventions for achieving management objectives. The technique starts with an initial intervention solution, i.e. a schedule, and then seeks a better one for achieving management objectives by making and evaluating gradual changes.

Lockwood and Moore (1993) first applied simulated annealing to the problem of finding a harvest intervention schedule that maximized sustainable wood supply while adhering to harvest block size limits and an harvest adjacency delay. They demonstrated that simulated annealing could handle such spatial constraints with reasonable speed and, at the same time, provide a near optimal solution. Nelson and Liu (1994) developed an SA algorithm to solve a similar problem and showed that SA was able to generate solutions superior to the hill climbing algorithm. Murray and Church (1995) and Boston and Bettinger (1999) compared simulated annealing to other meta-heuristics, e.g. tabu search and MCIP, and found out that SA was generally able to locate the best solution values to simple problems. Ohman and Eriksson (1998) demonstrated SA potential in maintaining core areas, i.e. contiguous old growth, as defined by Baskent and Jordan (1995a), using a small forest of 200 stands, a single treatment, a single rotation period, and a limited set of objectives. For landscape management problems, however, a large number of stands, a large set of management objectives and constraints, a large array of silvicultural treatments, and a long planning horizon exist. To date, simulated annealing potential in landscape management design has not been explored to that extent. Simulated annealing studies involving configuration, as well as composition, objectives are not evident.

Given the difficulty of applying traditional modeling approaches to landscape management design, and the potential of simulated annealing, the main objective of the research reported here was to demonstrate the utility of simulated annealing in providing solutions where both forest composition and configuration objectives exist. To this end, SA was used to formulate a landscape management problem and explain the spatial dynamics of four forests differing in age class and spatial structure.

Section snippets

Simulated annealing characteristics

Simulated annealing belongs to a class of modeling techniques, including tabu search and genetic algorithms, called meta-heuristics. These techniques are useful in solving combinatorial problems. Finding the optimum schedule of dozens of interventions for thousands of forest stands over a long planning horizon is an example.

Simulated annealing strives to find an optimum solution to combinatorial problems by iteratively using exploration and exploitation search techniques (Beasley et al., 1993).

Model development

A simulated annealing model for landscape management design was developed using the four aforementioned basic ingredients: forest model, objective function, transition schema, and control parameter.

Case study

The purpose of the case study was to demonstrate simulated annealing modeling in landscape management, and provide some insights into the effects of initial forest structure on compositional and configuration objectives.

The experiment involved four hypothetical forest landscapes. These hypothetical landscapes allowed for a controlled experiment by avoiding the confounding effects of complex spatial land-use patterns typical of actual forests. Each hypothetical forest landscape consists of 987

Case study results

Initially, LP was used to find global optimal solutions with only aspatial harvest objectives: total harvest and even harvest flow. The maximum even flow harvest levels were 272,000 m3 per period for the two forests with uniform age class distributions, UNICLUM and UNIFRAG, and 202,000 m3 per period for the forests with broken age class distributions, BRKCLUM and BRKFRAG. With the full suite of objectives in place, spatial as well as aspatial, the model produced solutions ranging from 72 to 99.9%

Discussion

Since any meta-heuristic technique, like simulated annealing used in this study, is a stochastic technique and particularly highly parameterized, it is obvious that a single run would be insufficient to assess the stability and the quality of the results. For the stability, we tested the variability through repeated random runs and found that the results vary only from 0.4 to 3.5%, indicating solution stability. For the quality, we further attempted several other runs with varying ranges of

Conclusions

We have developed a forest landscape management model based on a simulated annealing approach and shown through a case study that it accommodates multiple forest objectives. The objectives are defined and formulated by common non-monetary units using penalty cost functions. These functions are crucial since they provide a guiding mechanism whereby trade-offs can be made among different values identified in the objective function. While not demonstrated in the case study, the model is able to

Acknowledgements

This study was primarily funded by DMI Ltd. and AlPac Forest Industries Inc. in Alta., Canada. Support for this work was also provided by Karadeniz Technical University, Trabzon, Turkey. The Faculty of Forestry and Environmental Management at the University of New Brunswick provided the computer hardware and software facilities. We appreciate the thoughtful review the referees and the editors made of this manuscript. Their suggestions and commentary helped to improve it.

References (26)

  • Aarts E., Lenstra, K.J., 1997. Local Search in Combinatorial Optimization. Wiley, New...
  • E.Z. Baskent et al.

    Designing forest management to control spatial structure of landscapes

    Landscape and Urban Planning

    (1995)
  • E.Z. Baskent et al.

    Characterizing spatial structure of forest landscapes: a hierarchical approach

    Can. J. For. Res.

    (1995)
  • Baskent, E.Z., Wightman, R.A., Jordan, Glen A., Zhai, Y., 2001. Object oriented abstraction of contemporary forest...
  • D. Beasley et al.

    An overview of genetic algorithms. Part 1. Fundamentals

    Univ. Computing

    (1993)
  • Y. Bergeron et al.

    Forest management guidelines based on natural disturbance dynamics: stand and forest level considerations

    The Forestry Chronicle

    (1999)
  • P. Bettinger et al.

    Ensuring the compatibility of aquatic habitat and commodity production goals in eastern Oregon with a tabu search procedure

    For. Sci.

    (1998)
  • P. Bettinger et al.

    Intensifying a heuristic forest harvest scheduling search procedure with 2-opt decision choices

    Can. J. For. Res.

    (1999)
  • K. Boston et al.

    An analysis of MCIP, simulated annealing and tabu search heuristics for solving spatial harvest scheduling problems

    For. Sci.

    (1999)
  • E.J. Gustafson et al.

    Simulating spatial and temporal context of forest management using hypothetical landscapes

    Environ. Manage.

    (1998)
  • Harris, L.D., 1984. The Fragmented Forest. University of Chicago Press, Chicago,...
  • J. Hof et al.

    An integer programming approach for spatially and temporally optimizing wildlife populations

    For. Sci.

    (1994)
  • D.S. Johnson et al.

    Optimization by simulated annealing. Part 1. Graph partitioning

    Operation Res.

    (1989)
  • Cited by (65)

    • Optimal strategies for integrated forest management in megacities combined with wood and carbon services

      2019, Journal of Cleaner Production
      Citation Excerpt :

      In addition, the NPV is based on another important assumption that all the carbon sequestered by the growing stock can be traded in a domestic or international carbon market to contribute to mitigating global or regional climate change. The simulated annealing algorithm is a type of Monte Carlo method that uses a smart search to find the local best combination of management interventions under various constraints for achieving management objectives (Baskent and Jordan, 2002; Bettinger et al., 2002). This algorithm follows the entire process of metal annealing and is dedicated to exploring a subset of solutions by moving from one solution to a neighboring one, which slightly differs from the original solution.

    • Developing alternative forest spatial management plans when carbon and timber values are considered: A real case from northeastern China

      2018, Ecological Modelling
      Citation Excerpt :

      Simulated annealing has been used to address a set of forestry planning problems. For example, Boston and Bettinger (1999), Crowe and Nelson (2005), and Pukkala and Kurttila (2005) used simulated annealing to solve the adjacency-restricted harvest scheduling problem; Öhman, Öhman (2011) used simulated annealing to model old-growth interior; Bettinger et al. (2002) used simulated annealing to schedule timber harvests subjected to wildlife habitat quality goals; Baskent and Jordan (2002) employed simulated annealing to maintain forest landscape structure; and Dong et al. (2015a,b) utilized simulated annealing to model the trade-offs between forest timber production and carbon sequestration. Though simulated annealing has certain substantive limitations that may be worrisome to some forest planners, this heuristic algorithm has been shown to provide very good solutions to various complex forest planning problems when compared to other commonly used heuristic algorithms (Bettinger et al., 2002; Pukkala and Kurttila, 2005), such as the Monte Carlo simulation, the tabu search, the threshold accepting method, and the genetic algorithm.

    • A general corridor model for designing plug-in electric vehicle charging infrastructure to support intercity travel

      2016, Transportation Research Part C: Emerging Technologies
      Citation Excerpt :

      To address this limitation, a specialized metaheuristic solution method based on Simulated Annealing (SA) is developed and compared against a popular commercial solver in several numerical experiments. Note that the SA algorithm has been successfully employed to solve challenging optimization problems in general (e.g. Boston and Bettinger, 1999; Baskent and Jordan, 2002; McKendall et al., 2006; Dong et al., 2009), and facility location problems in particular (e.g. Murray and Church, 1996; Arostegui et al., 2006; Paik and Soni, 2007; Davari et al., 2011; Zockaie et al., 2016). For the remainder, Section 2 presents the model formulation, followed by the development of a specialized solution algorithm in Section 3.

    View all citing articles on Scopus
    View full text