Harvest scheduling with area-based adjacency constraints

Forest Science

Volumn 48, Issue 4, 2002, Pages 631-642

  McDill, M E ^a   Rebain, S A ^b   Braze, J ^c  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b USDA FOREST SERVICE   (United States)

^c Geographic Dynamics Corp   (Canada)

Author keywords

Area restriction models; Area based forest planning; Forest management; Integer programming; Spatial optimization; Unit restriction models

Indexed keywords

ALGORITHMS; COSTS; HARVESTING; LINEAR PROGRAMMING;

AREA RESTRICTION MODELS;

FORESTRY;

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

References (24)

1. American Forest & Paper Association (AF&PA). 2000. Sustainable Forestry Initiative™ Standard - 2000 Edition. AF&PA, Washington, DC. 5 p.
2. Borges, J.G, H.M. Hoganson, and D.W. Rose. 1999. Combining a decomposition strategy with dynamic programming to solve spatially constrained forest management scheduling problems. For. Sci. 45(2):201-212.
3. Boston, K., and P. Bettinger. 1999. An analysis of Monte Carlo integer programming, Simulated Annealing, and Tabu Search heuristics for solving spatial harvest scheduling problems. For. Sci. 45(2):292-301.
4. Braze, J. 1999. A Comparison of Alternative Adjacency Constraint Formulations in Forest Planning Models. M.Sc. Thesis, School of For. Resour., The Pennsylvania State Univ. 101 p.
5. 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(4):526-538.
6. Hunter, M.L., JR. 1990. Wildlife, Forests, and Forestry: Managing Forests for Biodiversity. Prentice Hall, Englewood Cliffs, NJ. 370 p.
7. Johnson, K.H., and H.L. Scheurman. 1977. Techniques for prescribing optimal timber harvest and investment under different objectives - Discussion and synthesis. For. Sci. Monogr. 18.
8. Lockwood, C., and T. Moore. 1992. Harvest scheduling with spatial constraints: A simulated annealing approach. Can. J. For. Res. 23:468-478.
9. McDill, M.E., and J. Braze. 2000. Comparing adjacency constraint formulations for randomly generated forest planning problems with four age-class distributions. For. Sci. 46(3):423-436.
10. McDill, M.E., and J. Braze. 2001. Using the branch and bound algorithm to solve forest planning problems with adjacency constraints. For. Sci. 47(3):403-418.
11. Meneghin, B.J., M.W. Kirby, and J.G. Jones. 1988. An algorithm for writing adjacency constraints efficiently in linear programming models. P. 46-53 in The 1988 Symposium on Systems Analysis in Forest Resources, Kent, B., and L. Davis (eds.). USDA For. Serv. Rocky Mt. For. Range Exp. Sta. Gen. Tech. Rep. RM-161.
12. Murray, A.T. 1999. Spatial restrictions in harvest scheduling. For. Sci. 45(1):45-52.
13. Murray, A.T., and R.L. Church. 1995. Measuring the efficacy of adjacency constraint structure in forest planning models. Can. J. For. Res. 25:1416-1424.
14. Murray, A.T., and R.L. Church. 1996a. Constructing and selecting adjacency constraints. INFOR 34:232-248.
15. Murray, A.T., and R.L. Church. 1996b. Analyzing cliques for imposing adjacency restrictions in forest models. For. Sci. 42(2):166-175.
16. Nelson, J.D., 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.
17. Nelson, J.D., J.D. Brodie, and J. Sessions. 1991. Integrating short-term, area-based logging plans with long-term harvest schedules. For. Sci. 37(1):101-122.
18. Snyder, S., and C. ReVelle. 1996a. The grid packing problem: Selecting a harvest pattern in an area with forbidden regions. For. Sci. 42(1):27-34.
19. Snyder, S., and C. ReVelle. 1996b. Temporal and spatial harvesting of irregular systems of parcels. Can. J. For. Res. 26:1079-1088.
20. Snyder, S., and C. ReVelle. 1997. Dynamic selection of harvests with adjacency restrictions: The SHARe model. For. Sci. 43(2):213-222.
21. Torres-Rojo, J.M., and J.D. Brodie. 1990. Adjacency constraints in harvest scheduling: An aggregation heuristic. Can. J. For. Res. 20:978-986.
22. U.S. Congress. 1976. National Forest Management Act. (88 Stat. 476; 16 U.S.C. 1601-1610), October 22.
23. Weintraub, A., F. Barahona, and R. Epstein. 1994. A column generation algorithm for solving general forest planning problems with adjacency constraints. For. Sci. 40(1):142-161.
24. Yoshimoto, A., and J.D. Brodie. 1994. Comparative analysis of algorithms to generate adjacency constraints. Can. J. For. Res. 24:1277-1288.