Abstract
Restrictions on the size and proximity of clearcuts have led to the development of a variety of exact and heuristic methods to optimize the net present value of timber harvests, subject to adjacency constraints. Most treat harvest units as pre-defined, and impose adjacency constraints on any two units sharing a common border. By using graph theory notation to define sub-graph adjacency constraints, opening size can be considered variable, which may be more appropriate for landscape-level planning. A small example data set is used in this paper to demonstrate the difference between the two types of adjacency constraints for both integer programming and heuristic solution methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Aigner, Graph Theory: A Development from the 4-Color Problem (BCS Assoc., Moscow, ID, 1987).
K. Appel and W. Haken, Every Planar Map is Four Colorable (American Mathematical Society, Providence, RI, 1989).
T.M. Barrett, Voronoi tessellation methods to delineate harvest units for spatial forest planning, Can. J. For. Res. 27 (1997) 903–910.
T.M. Barrett, J.K. Gilless and L.S. Davis, Economic and fragmentation effects of clearcut restrictions, Forest Science 44(4) (1998) 569–577.
J. Buongiorno and J.K. Gilless, Forest Management and Economics (Macmillan, New York, 1987).
Cal. Dept. of Forestry and Fire Protection, California forest practice rules, Title 14, California Code of Regulations, June 1994 version, first printing, CDFFP, 1416 Ninth Street, Sacramento, CA 95814.
G. Chartrand, Graphs as Mathematical Models (Prindle, Weber and Schmidt, Boston, 1977).
B. Dahlin and O. Sallnas, Harvest scheduling under adjacency constraints - a case study from the Swedish sub-alpine region, Scand. J. For. Res. 8 (1993) 281–280.
D.K. Daust and J.D. Nelson, Spatial reduction factors for strata-based harvest schedules, For. Sci. 39(1) (1993) 152–165.
L.S. Davis and K.N. Johnson, Forest Management (McGraw-Hill, San Francisco, 1987).
J.R. Evans and E. Minieka, Optimization Algorithms for Networks and Graphs (M. Dekker, New York, 1992).
H.M. Hogansen and J.G. Borges, Using dynamic programming and overlapping subproblems to address adjacency in large harvest scheduling problems, For. Sci. 44(4) (1998) 526–538.
M.S. Jamnick and K.R. Walters, Spatial and temporal allocation of stratum-based harvest schedules, Can. J. For. Res. 23 (1993) 402–413.
T.R. Jensen and B. Toft, Graph Coloring Problems (Wiley, New York, 1995).
Ketron, MIPIII User's Manual, Ketron Management Science, 1755 Jefferson Davis Hwy., #901, Arlington, VA 22202-3557 USA (1996).
A. Lockwood and T. Moore, Harvest scheduling with spatial constraints: a simulated annealing approach, Can. J. For. Res. 23 (1992) 468–478.
Maine Forest Service, Forest regeneration & clearcutting standards and summary, October 1990 with January 1991 revisions, Forest Information Center, SHS#22, Augusta, ME 04333.
J.L. Mott, A. Kandel and T.P. Baker, Discrete Mathematics for Computer Scientists and Mathematicians (Prentice-Hall, Englewood Cliffs, NJ, 1986).
A. Murray and R. Church, Heuristic solution approaches to operational forest planning problems, OR Spektrum 17(2/3) (1995) 193–203.
J. Nelson and J.D. Brodie, Comparison of a random search algorithm and mixed integer programming for solving area-based forest plans, Can. J. For. Res. 20 (1990) 934–942.
J. Nelson, J.D. Brodie and J. Sessions, Integrating short-term, area-based logging plans with longterm harvest schedules, For. Sci. 37(1) (1991) 101–122.
J.D. Nelson and S.T. Finn, The influence of cut-block size and adjacency rules on harvest levels and road networks, Can. J. For. Res. 21 (1991) 595–600.
T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms (Elsevier, New York, 1988).
A.J. O'Hara, B.H. Faaland and B.B. Bare, Spatially constrained timber harvest scheduling, Can. J. For. Res. 19 (1989) 715–724.
Oregon Dept. of Forestry, Oregon forest practice rules and statutes, June 1, 1993, Oregon Dept. of Forestry, 2600 State St., Salem, OR 97310.
S. Snyder and C. ReVelle, Temporal and spatial harvesting of irregular systems of parcels, Can. J. For. Res. 26 (1996) 1079–1088.
L.G. Underhill, Optimal and suboptimal reserve selection algorithms, Biological Conservation 70 (1994) 85–87.
Washington Dept. of Natural Resources, Washington Forest Practices, 1996, Forest Practices Division, P.O. Box 47012, Olympia, WA 98504-7012.
A.Weintraub, M. Guignard and R. Epstein, Exact and approximate algorithms for forest management problems, in: Proceedings of the 1994 Symposium on Systems Analysis in Forest Resources, eds. J. Sessions and J.D. Brodie (Pacific Grove, CA, September 6-9, 1994) pp. 372–377.
Westland Resource Group, A Comparative Review of the Forest Practices Code of British Columbia with Fourteen Other Jurisdictions (Crown Publications, Victoria, BC, Canada, 1995).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Barrett, T., Gilless, J. Even-aged restrictions with sub-graph adjacency. Annals of Operations Research 95, 159–175 (2000). https://doi.org/10.1023/A:1018993822494
Issue Date:
DOI: https://doi.org/10.1023/A:1018993822494