A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints

Abstract Due to environmental concerns, forest harvesting in many regions must now satisfy adjacency, or green-up constraints. As a result, the forest harvesting problem, which originally could be formulated as a linear programming problem, becomes combinatorial in nature. Moreover, current harvest scheduling codes, like FORPLAN, Timber RAM and others, are unable to generate harvest schedules satisfying the adjacency constraints. In this paper we formulate forest harvesting problems with adjacency constraints arising in the Tangier watershed as multicriteria optimization problems. We use tabu search to investigate the trade-offs among the different criteria which were chosen as the total volume of lumber cut, the period to period deviation from even-flow of lumber during a harvest rotation and adjacency violations. Apparently, the tabu search methodology can be easily applied to solve harvesting problems with adjacency constraints. For harvesting problems in the Tangier watershed, the tabu search is shown to produce better schedules than the O'Hara et al. method (1989), which is considered to be one of the most effective approaches for forest harvesting problems. We also confirm the expected outcome that requiring adherence to green-up constrains, or to certain limitations on flow deviations, will reduce the total volume of lumber that can be cut. However, our approach is sufficiently effective to reveal that for the forest harvesting problems in the Tangier watershed which we studied, this volume reduction does not exceed 8%, and sometimes even does not exceed 2% of the total volume that could be possibly cut.

[1]  D. K. Daust,et al.  Spatial Reduction Factors for Strata-Based Harvest Schedules , 1993, Forest Science.

[2]  John Nelson,et al.  Area-based harvest scheduling and allocation of forest land using methods for multiple-criteria decision making , 1993 .

[3]  C. Lockwood,et al.  Harvest scheduling with spatial constraints: a simulated annealing approach , 1993 .

[4]  J. Nelson,et al.  The influence of cut-block size and adjacency rules on harvest levels and road networks , 1991 .

[5]  Karl R. Walters,et al.  Spatial and temporal allocation of stratum-based harvest schedules , 1993 .

[6]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[7]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[8]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[9]  J D Dyer,et al.  Paying the piper. , 1987, Healthcare computing & communications.

[10]  M. S. Jamnick,et al.  An operational, spatially constrained harvest scheduling model , 1990 .

[11]  Michael S. McPherson,et al.  Paying the Piper , 1994 .

[12]  B. Bruce Bare,et al.  Spatially constrained timber harvest scheduling , 1989 .

[13]  B. Bare,et al.  Timber harvest scheduling in a fuzzy decision environment , 1992 .

[14]  John Sessions,et al.  Integrating Short-Term, Area-Based Logging Plans with Long-Term Harvest Schedules , 1991, Forest Science.

[15]  Jonna Gourley,et al.  Trees : timber resource economic estimation system , 1980 .

[16]  Thomas E. Mafera.  Tactical forest planning using the scheduling and network analysis program (SNAP II) , 1992 .

[17]  Donald Ludwig.  Forest management strategies that account for short-term and long-term consequences , 1993 .

[18]  B. Golden,et al.  Interval estimation of a global optimum for large combinatorial problems , 1979 .

[19]  T. E. Gross.  Harvest scheduling with nonadjacency constraints , 1989 .

[20]  H. L. Scheurman,et al.  Techniques for Prescribing Optimal Timber Harvest and Investment Under Different Objectives—Discussion and Synthesis , 1977 .

[21]  Kevin Donald Boston.  Using Tabu Search to solve tactical forest planning problems with spatial wildlife habitat goals and constraints , 1996 .

[22]  A. F. Howard,et al.  A three-stage heuristic procedure for allocating spatially and temporally feasible cutting rights on public lands , 1991 .

[23]  Francisco Barahona,et al.  Habitat Dispersion in Forest Planning and the Stable Set Problem , 1992, Oper. Res..

[24]  Sheng-Roan Kai,et al.  Design and Implementation of an Interactive Optimization System for Telephone Network Planning , 1992, Oper. Res..

[25]  John Meadows.  Systems analysis and forest resource management , 1975 .

[26]  J. Douglas Brodie,et al.  Adjacency constraints in harvest scheduling: an aggregation heuristic , 1990 .

[27]  A. Howard.  A critical look at multiple criteria decision making techniques with reference to forestry applications , 1991 .

[28]  Dietmar W. Rose,et al.  A simulation approach for optimal timber management scheduling , 1984 .