Impacts of the time horizon for adjacency constraints in harvest scheduling

Forest Science

Volumn 46, Issue 2, 2000, Pages 176-187

  Hoganson, Howard M ^a   Borges, Jose G ^b  

^a Univ Minnesota N Ctrl Exp Stn   (United States)

^b INSTITUTO SUPERIOR DE AGRONOMIA   (Portugal)

Author keywords

Dynamic programming; Landscape level planning; Optimal rotation age

Indexed keywords

EID: 0034087557     PISSN: 0015749X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (33)

1. BARRETT, T.M., J.K. GILLESS, AND L.S. DAVIS. 1998. Economic and fragmentation effects of clearcut restrictions. For. Sci. 44:569-577.
2. BETTINGER, P., J. SESSIONS, AND K.N. JOHNSON. 1998. Ensuring the compatibility of aquatic habitat and commodity production goals in eastern Oregon with a tabu search procedure. For. Sci. 44:96-112.
3. BETTINGER, P., J. SESSIONS, AND K. BOSTON. 1997. Using Tabu search to schedule timber harvests subject to spatial wildlife goals for big game. Ecol. Model. 94:111-123.
4. BORGES, J.G., H.M HOGANSON, AND D.W. ROSE. 1999. Combining a decomposition strategy with dynamic programming to solve the spatially constrained forest management scheduling problems. For. Sci. 45:201-212.
5. CAMENSON, D., K. SLEAVIN, AND K. GREER. 1996. Spectrum: An analytical tool for building natural resource management models. P. 133-142 Large-scale forestry scenario models: Experiences and requirements, in Paivinen, R., L. Roihuvuo, and M. Siitoinen (eds.). Eur. For. Inst. Proc. no. 5.
6. CARTER, D.R., M. VOGIATZIS, C.B. MOSS, AND L.G. ARVANITIS. 1997. Ecosystem management or infeasible guidelines? Implications of adjacency restrictions for wildlife habitat and timber production. Can. J. For. Res. 27:1302-1310.
7. CHURCH, R., A. MURRAY, AND K. BARBER. 1994. Designing a hierarchial planning model for USDA Forest Service planning. P. 401-409 in Proc. of the 1994 Symp. on Systems Analysis in Forest Resources. Pacific Grove, CA. 482 p.
8. DAHLIN, B., AND O. SALLNAS. 1993. Harvest scheduling under adjacency constraints - a case study from the Swedish sub-alpine region. Scand. J. For. Res. 8:281-290.
9. DAVIS, L., AND K. JOHNSON. 1987. Forest management. Ed. 3. McGraw Hill, New York. 690 p.
10. FISHER, M.L. 1981. The Lagrangian relaxation method for solving integer programming problems. Manage. Sci. 27:1-18.
11. GUNN, E.A., AND A.K. RAI. 1987. Modelling and decomposition for planning long-term forest harvesting in an integrated forest industry structure. Can. J. For. Res. 17:1507-1518.
12. GUNN, E.A., M. THORBURN, AND A.K. RAI. 1988. A decomposition method based on the augmented lagrangian. INFOR. 26:91-113.
13. HOGANSON, H.M., AND J.G. BORGES. 1998. Using dynamic programming and overlapping subproblems to address adjacency in large harvest scheduling problems. For. Sci 44:526-538.
14. HOGANSON, H.M., AND D. KAPPLE. 1995. Estimating impacts of extended rotation forestry. Final report on file at the Minnesota Department of Natural Resources, Grand Rapids, MN. 170 p.
15. HOGANSON, H.M., AND D.W. ROSE. 1984. A simulation approach for optimal timber management scheduling. For. Sci. 30:220-238.
16. JAAKKO PÖYRY CONSULTING, INC. 1994. Generic environmental impact statement on timber harvesting and forest management in Minnesota. Jaako Pöyry Consulting, Inc., Tarrytown, New York. 813 p.
17. LAPPI, J. 1992. JLP: A linear programming package for management planning. The Finnish For. Res. Inst. Res. Pap. 414, 134 p.
18. LOCKWOOD, C., AND T. MOORE. 1993. Harvest scheduling with spatial constraints: A simulated annealing approach. Can. J. For. Res. 23:468-478.
19. MURRAY, A.T. 1999. Spatial restrictions in harvest scheduling. For. Sci. 45:45-52.
20. MURRAY, A.T., AND R.L. CHURCH. 1995. Heuristic solution approaches to operational forest planning problems. OR Spektrum 17:193-203.
21. Murray, A.T., and R.L. Church. 1996a. Analyzing cliques for imposing adjacency restrictions in forest models. For. Sci. 166-175.
22. MURRAY, A.T., AND R.L. CHURCH. 1996b. Constructing and selecting adjacency constraints. Infor 34:232-247.
23. NELSON, J., AND J.D. BRODIE. 1990. Comparison of a random search algorithm and mixed integer programming for solving area-based forest plans. Can. J. For. Res. 20:934-942.
24. NELSON, J., J.D. BRODIE, AND J.SESSIONS. 1991. Integrating short-term area-based logging plans with long-term harvest schedules. For. Sci. 37:101-122.
25. PAREDES, G.L., AND J.D. BRODIE. 1989. Land value and the linkage between stand and forest level analysis. Land Econ. 65:158-166.
26. SAATY, T.L., AND P.C. KAINEN. 1977. The four-color problem: Assaults and conquests. McGraw-Hill, New York. 217 p.
27. SCHWEITZER, D.L., R.W. SASSAMAN, AND C.H. SCHALLAU. 1972. Allowable cut effect, some physical and economic implications. J. For. 70:415-418.
28. SNYDER, S., AND C. REVELLE. 1996a. The grid packing problem: Selecting a harvest pattern in an area with forbidden regions. For. Sci. 42:27-34.
29. SNYDER, S., AND C. REVELLE. 1996b. Temporal and spatial harvesting of irregular systems of parcels. Can. J. For. Res. 26:1079-1088.
30. SNYDER, S., AND C. REVELLE. 1997. Dynamic selection of harvests with adjacency restrictions: The SHARe model. For. Sci. 43:213-222.
31. WEINTRAUB, A., F. BARAHONA, AND R. EPSTEIN. 1994. A column generation algorithm for solving general forest planning problems with adjacency constraints. For. Sci. 40:142-161.
32. WEINTRAUB, A., AND A. CHOLAKY. 1991. A hierarchical approach to forest planning. For. Sci. 37:439-460.
33. YOSHIMOTO, A., J.D. BRODIE, AND J. SESSIONS. 1994. A new heuristic to solve spatially constrained long-term harvest scheduling problems. For. Sci. 40:365-396.