Using dynamic programming and overlapping subproblems to address adjacency in large harvest scheduling problems

Forest Science

Volumn 44, Issue 4, 1998, Pages 526-538

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

^a UNIVERSITY OF MINNESOTA   (United States)

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

^c INSTITUTO SUPERIOR DE AGRONOMIA   (Portugal)

Author keywords

Adjacency constraints; Forest edge; Forest management scheduling; Spatial modeling

Indexed keywords

AGRONOMY; COMPUTER SIMULATION; CONSTRAINT THEORY; CROPS; DECISION MAKING; DYNAMIC PROGRAMMING; HARVESTING; MANAGEMENT; PROBLEM SOLVING;

ADJACENCY CONSTRAINTS; FOREST EDGE; FOREST MANAGEMENT SCHEDULING; SPATIAL MODELLING;

FORESTRY;

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

References (25)

1. AMIDON, E.L., AND G.S. AKIN. 1968. Dynamic programming to determine optimal levels of growing stock. For. Sci. 14:287-291.
2. BETTINGER, P., K.N. JOHNSON, AND J. SESSIONS. 1996. Forest planning in an Oregon case study: Defining the problem and attempting to meet goals with a spatial-analysis technique. J. Environ. Manage. 20:565-577.
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. CHURCH, R.L., A.T. MURRAY, AND K. BARBER. 1994. Designing a hierarchical planning model for USDA Forest Service planning. P. 401-409 in Proc. of the 1994 symp. on Systems analysis in forest resources, Sessions, J., and J.D. Brodie (eds.). Oregon State University, Corvallis, OR.
5. DUNSWORTH, G.B., AND S.M. NORTHWAY. 1997. Spatial assessment of habitat supply and harvest values as a means of evaluating conservation strategies: A case study. In Proc. of the European Forest Institute assessment of biodiversity for improved forest planning, Ascona Switzerland. Kluwer Academic Publishers, Dordrecht, The Netherlands. (In press.)
6. HILLIER, F.S., AND G.J. LIEBERMAN. 1990. Introduction to operations research. McGraw-Hill Publishing Co. New York. 953 p.
7. HOGANSON, H.M., AND D.W. ROSE. 1984. A simulation approach for optimal timber management scheduling. For. Sci. 30:220238.
8. JOHNSON, K.N., AND H.L. SCHEURMAN. 1977. Techniques for prescribing optimal timber harvest and investment under different objectives discussion and synthesis. For. Sci. Monogr. No. 18. 31 p.
9. JONES, J.G., B.J. MENEGHIN, AND M.W. KIRBY. 1991. Formulating adjacency constraints in optimization models for scheduling projects in tactical planning. For. Sci. 37:1283-1297.
10. LOCKWOOD, C., AND T. MOORE. 1993. Harvest scheduling with spatial constraints: A simulated annealing approach. Can. J. For. Res. 23:468-478.
11. MURRAY, A.T., AND R.L. CHURCH. 1994. Adjacency constraint aggregation P. 131-138 in Proc. of the international symp. on systems analysis and management decisions in forestry. Paredes, G.L. (ed.). For. Manage. Inst., Valdivia, Chile.
12. 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.
13. PELKKI, M.H. 1997. The effects of neighborhood storage size on dynamic programming solutions. For. Sci. 43:387-395.
14. ROISE, J.P. 1990. Multicriteria nonlinear programming for optimal spatial allocation of stands. For. Sci. 36:487-501.
15. SESSIONS, J., AND J.B. SESSIONS. 1993. SnapII+ version 2.07 user's guide. USDA Forest Service, Washington Office. Ft. Collins, CO.
16. 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.
17. SNYDER, S., AND C. REVELLE. 1996b. Temporal and spatial harvesting of irregular systems of parcels. Can. J. For. Res. 26:10791088.
18. SNYDER, S., AND C. REVELLE. 1997. Dynamic selection of harvests with adjacency restrictions: The SHARe model. For. Sci. 43:213222.
19. TORRES-ROJO, J.M., AND J.D. BRODIE. 1990. Adjacency constraints in harvest scheduling: An aggregation heuristic. Can. J. For. Res. 20:978-986.
20. VAN DEUSEN, P.C. 1996. Habitat and harvest scheduling using bayesian statistical concepts. Can. J. For. Res. 26:1375-1383.
21. 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.
22. WEINTRAUB, A., AND A. CHOLAKY. 1991. A hierarchical approach to forest planning. For. Sci. 37:439-460.
23. WIGHTMAN, R., AND E. BASKENT. 1994. Forest neighborhoods for timber harvest scheduling. For. Chron. 70:768-772.
24. YOSHIMOTO, A., AND J.D. BRODIE. 1994. Comparative analysis of algorithms to generate adjacency constraints. Can. J. For. Res. 24:1277-1288.
25. 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.