Assessing the impact of management unit design and adjacency constraints on forestwide spatial conditions and timber revenues

Canadian Journal of Forest Research

Volumn 29, Issue 11, 1999, Pages 1764-1774

  Borges, José G ^a   Hoganson, Howard M ^b  

^a INSTITUTO SUPERIOR DE AGRONOMIA   (Portugal)

^b UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FOREST MANAGEMENT; HETEROGENEITY; TIMBER INDUSTRY;

EID: 0033492112     PISSN: 00455067     EISSN: None     Source Type: Journal    
DOI: 10.1139/x99-131     Document Type: Article

References (43)

1. Baker, W.L. 1992. The landscape ecology of large disturbances in the design and management of nature reserves. Landscape Ecol. 7: 181-194.
2. Barrett, T.M. 1996. A methodology for evaluation of the economic, forest fragmentation, and wildlife habitat effects of policies restricting size and adjacency of clearcut timber harvests. Ph.D. dissertation, University of California, Berkeley.
3. Barrett, T.M. 1997. Voronoi tessellation methods to delineate harvest units for spatial forest planning. Can. J. For. Res. 27: 903-910.
4. Baskent, E.Z., and Jordan, G.A. 1995. Characterizing spatial structure of forest landscapes. Can. J. For. Res. 25: 1830-1849.
5. Borges, J.G., Hoganson, H.M., and Rose, D. 1999. Combining a decomposition strategy with dynamic programming to solve the spatially constrained forest management scheduling problem. For. Sci. 45: 201-212.
6. Boyce, S.G. 1995. Landscape forestry. John Wiley & Sons, Inc., New York.
7. Bradshaw, F.J. 1992. Quantifying edge effect and patch size for multiple-use silviculture - a discussion paper. For. Ecol. Manage. 48: 249-264.
8. Clements, S.E., Dallain, P.L., and Jamnick, M.S. 1990. An operational, spatially constrained harvest scheduling model. Can. J. For. Res. 20: 1438-1447.
9. Covington, W.W., Wood, D.B., Young, D.L., Dykstra, O.P., and Garret, L.D. 1988. TEAMS: a decision support system for multiresource management. J. For. 86(8): 25-33.
10. Dahlin, B., and Sallnas, O. 1993. Harvest scheduling under adjacency constraints - a case study from the Swedish sub-alpine region. Scand. J. For. Res. 8: 281-290.
11. Forman, R.T. 1997. Land mosaics. The ecology of landscapes and regions. Cambridge University Press, Cambridge, U.K.
12. Franklin, J.F., and Forman, R.T. 1987. Creating landscape patterns by forest cutting: ecological consequences and principles. Landscape Ecol. 1: 5-18.
13. Gross, T.E., and Dykstra, D.P. 1988. Harvest scheduling with nonadjacency constraints. In Proceedings of the 1988 SAF National Convention, Rochester, N.Y. pp. 310-315.
14. Hof, J., Bevers, M., Joyce, L., and Kent, B. 1994. An integer programming approach for spatially and temporally optimizing wildlife populations. For. Sci. 40: 177-191.
15. Hof, J.G., and Joyce, L.A. 1993. A mixed integer linear programming approach for spatially optimizing wildlife and timber in managed forest ecosystems. For. Sci. 39: 816-834.
16. Hoganson, H.M., and Borges, J.G. 1998. Using dynamic programming and overlapping subproblems to address adjacency in large harvest scheduling problems. For. Sci. 44: 526-538.
17. Hunter, M.L. 1990. Wildlife, forests and forestry. Principles of managing forests for biological diversity. Prentice Hall, Inc., Englewood Cliffs, N.J.
18. Jaako Poyry Consulting, Inc. 1994. Generic environmental impact statement on timber harvesting and forest management in Minnesota. Report prepared by Jaako Poyry Consulting, Inc., Tarrytown, N.Y. Available from Minnesota Environmental Quality Board, 300 Centennial Office Building, 658 Cedar Street, St. Paul, MN 55155, U.S.A.
19. Jamnick, M.S. and Walters, K.R. 1993. Spatial and temporal allocation of stratum-based harvest schedules. Can. J. For. Res. 23: 402-413.
20. Jones, J.G., Meneghin, B.J., and Kirby, M.W. 1991. Formulating adjacency constraints in linear optimization models for scheduling projects in tactical planning. For. Sci. 37: 1283-1297.
21. Kenan, R.J., and Kimmins, J.P. 1993. The ecological effects of clear-cutting. Environ. Rev. 1: 121-144.
22. Kirby, M.W. 1980. A guide to the integrated resources planning model. USDA Forest Service, Pacific Southwest Forest Experiment Station, Berkeley, Calif.
23. Lockwood, C., and Moore, T. 1993. Harvest scheduling with spatial constraints: a simulated annealing approach. Can. J. For. Res. 23: 468-478.
24. Meneghin, B.J., Kirby, M.W., and Jones, J.G. 1988. An algorithm for writing adjacency constraints efficiently in linear programming models. In Proceedings of the 1988 Symposium on Systems Analysis in Forest Resources, USDA For. Serv. Gen. Tech. Rep. RM-161. pp. 46-53.
25. Minnesota Department of Natural Resources (DNR). 1994. Extended rotation guidelines. Minnesota DNR, 500 Lafayette Road, St. Paul, MN 55155, U.S.A.
26. Murray, A., and Church, R. 1995a. Heuristic solution approaches to operational forest planning problems. OR [Oper. Res.] Spektrum, 17: 193-203.
27. Murray, A., and Church, R. 1995b. Measuring the efficacy of adjacency constraint structure in forest planning models. Can. J. For. Res. 25: 1416-1424.
28. Naiman, R.J., Décamps, H., and Pollock, M. 1993. The role of riparian corridors in maintaining regional biodiversity. Ecol. Appl. 3: 209-212.
29. Nelson, J.D., and Brodie, J.D. 1990. Comparison of a random search algorithm and mixed integer programming for solving area-based forest plans. Can. J. For. Res. 20: 934-942.
30. Nelson, J.D., and Errico, D. 1993. Multiple-pass harvesting and spatial constraints: an old technique applied to a new problem. For. Sci. 39: 137-151.
31. Nelson, J.D., Brodie, J.D., and Sessions, J. 1991. Integrating short-term, area-based logging plans with long-term harvest schedules. For. Sci. 37: 101-122.
32. O'Hara, A.J., Faaland, B.H., and Bare, B.B. 1989. Spatially constrained timber harvest scheduling. Can. J. For. Res. 19: 715-724.
33. Reeves, C.R. 1993. Modern heuristic techniques for combinatorial problems. 1st ed. John Wiley & Sons, Inc., New York.
34. Roise, J.P. 1990. Multicriteria nonlinear programming for optimal spatial allocation of stands. For. Sci. 36: 487-501.
35. Saaty, T.L., and Kainen, P.C. 1977. The four-color problem: assaults and conquests. 1st ed. McGraw-Hill, Inc., New York.
36. Snyder, S., and ReVelle, C. 1996a. The grid packing problem: selecting a harvest pattern in an area with forbidden regions. For. Sci. 42: 27-34.
37. Snyder, S., and ReVelle, C. 1996b. Temporal and spatial harvesting of irregular systems of parcels. Can. J. For. Res. 26: 1079-1088.
38. Snyder, S., and ReVelle, C. 1997. Dynamic selection of harvests with adjacency restrictions: the SHARe model. For. Sci. 43: 213-222.
39. Taha, H.A. 1992. Operations research: an introduction. 5th ed. McMillan Publishing Co., New York.
40. Torres-Rojo, J.M., and Brodie, J.D. 1990. Adjacency constraints in harvest scheduling: an aggregation heuristic. Can. J. For. Res. 20: 978-986.
41. Wallin, D.O., Swanson, F.J., and Marks, B. 1994. Landscape pattern response to changes in pattern generation rule: land use legacies in forestry. Ecol. Appl. 4: 569-580.
42. Weintraub, A., Barahona, B., and Epstein, R. 1994. A column generation algorithm for solving general forest planning problems with adjacency constraints. For. Sci. 40: 142-161.
43. Yoshimoto, A., and Brodie, J.D. 1994. Comparative analysis of algorithms to generate adjacency constraints. Can. J. For. Res. 24: 1277-1288.