Title: Creating stewardship zones: managing the intensity of timber harvesting
1Creating stewardship zones managing the
intensity of timber harvesting
UBC
Centre for Applied Conservation Research
2Weyerhaeusers Forest Project
- Zone the intensity of timber harvesting
- Variable Retention logging
- Adaptive Management program
3Stewardship Zones
4- Zoning ! Multiple-use
- Old seral objectives from the OG zone
- Timber objectives from the Timber zone
- Some flexibility in the Habitat zone to capture
the rest.
Location of the zones VERY important!
5Zone Parameters
- Ecological Representation
- 18 BEC variants
- Size
- 5,000 ha minimum region size
- Shape
- globular, not linear
- Push objectives
- Tenure, Age, Productivity, ENGO proposals
6Zone Allocation Model
- Large, large areas.
- Fixed zone allocations.
- Simulated Annealing algorithm.
- Objectives
- Size and Shape
- Ecological representation Target (/-)
- Push Objectives Minimum Level (-)
7Weyerhaeuser's coastal holdings
- 1.2 Million ha
- 300,000 polygons
8Tiling procedure
- Hexagonal tiles overlaid on the landbase
- Resultant polygons have tile_ID
- Model groups polygons by tile_ID
- No loss of precision
- Seven tile sizes used.
9Tile configurations
10Tile configurations
10K
200K
11Algorithm Performance
- Tested against
- Other algorithms
- Hill Climbing (HC)
- Monte Carlo (MC)
- Theoretical optimum score.
- Problems of increasing difficulty.
12Against other algorithms
100K
Simulated annealing substantially better.
13Against other algorithms
14Against theoretical optimum
- Penalty score (Z) is the sum of the penalties.
- 6 types of penalties all are targets, evaluating
to 0 when satisfied. - Z 0 is the theoretical optimum.
15Against theoretical optimum
- Adjust the theoretical optimum
Not all objectives can be satisfied.
16Against theoretical optimum
- Average, best, worst scores u theoretical
optimum score
17Against problems of increasing difficulty
HC
SA
18Zone Allocations
19Zone Allocations
20Conclusions
- Zone model works
- Better than other algorithms
- Within 4 to 11 of theoretical optimum
- Scales against increasingly difficult problems
- No free lunches
- But less expensive than human designers
- Flexibility vs. problem size