Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches

We consider a spatial problem arising in forest harvesting. For regulatory reasons, blocks harvested should not exceed a certain total area, typically 49 hectares. Traditionally, this problem, called the adjacency problem, has been approached by forming a priori blocks from basic cells of 5 to 25 hectares and solving the resulting mixed-integer program. Superior solutions can be obtained by including the construction of blocks in the decision process. The resulting problem is far more complex combinatorially. We present an exact algorithmic approach that has yielded good results in computational tests. This solution approach is based on determining a strong formulation of the linear programming problem through a clique representation of a projected problem.

[1]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[2]  Kevin A. Crowe,et al.  Solving the area-restricted harvest-scheduling model using the branch and bound algorithm , 2003 .

[3]  George L. Nemhauser,et al.  Min-cut clustering , 1993, Math. Program..

[4]  Bernard G. Halterman,et al.  Integrating timber and wildlife management planning , 1973 .

[5]  M. Pérez,et al.  A Methodology to Analyze Divergent Case Studies of Non-Timber Forest Products and Their Development Potential , 1999 .

[6]  J. G. Jones,et al.  Formulating adjacency constraints in linear optimization models for scheduling projects in tactical planning , 1991 .

[7]  José G. Borges,et al.  Using dynamic programming and overlapping subproblems to address adjacency in large harvest scheduling problems , 1998 .

[8]  Helman I. Stern,et al.  COMPUTER SCHEDULING OF PUBLIC TRANSPORT. URBAN PASSENGER VEHICLE AND CREW SCHEDULING. PAPERS BASED ON PRESENTATIONS AT THE INTERNATIONAL WORKSHOP HELD AT THE UNIVERSITY OF LEEDS, 16-18 JULY, 1980 (CONTD) , 1981 .

[9]  Leslie E. Trotter,et al.  On stable set polyhedra for K1, 3-free graphs , 1981, J. Comb. Theory, Ser. B.

[10]  Tara M. Barrett,et al.  Voronoi tessellation methods to delineate harvest units for spatial forest planning , 1997 .

[11]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[12]  G. Nemhauser,et al.  A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing , 1992 .

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

[14]  Marc E. McDill,et al.  Harvest Scheduling with Area-Based Adjacency Constraints , 2002, Forest Science.

[15]  G. Nemhauser,et al.  An Optimization Based Heuristic for Political Districting , 1998 .

[16]  L. Lovász,et al.  Polynomial Algorithms for Perfect Graphs , 1984 .

[17]  Kevin Boston,et al.  The economic impact of green-up constraints in the southeastern United States , 2001 .

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

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

[20]  Timothy P. McDonald,et al.  A Three-Stage Heuristic for Harvest Scheduling with Access Road Network Development , 2000 .

[21]  Richard L. Church,et al.  Heuristic solution approaches to operational forest planning problems , 1995 .

[22]  Leslie E. Trotter,et al.  Properties of vertex packing and independence system polyhedra , 1974, Math. Program..

[23]  Richard L. Church,et al.  Facets for node packing , 1997 .

[24]  J. K. Gilless,et al.  Economic and fragmentation effects of clearcut restrictions , 1998 .

[25]  T. M. Barrett,et al.  Even-aged restrictions with sub-graph adjacency , 2000, Ann. Oper. Res..

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

[27]  E. Gunn,et al.  A model and Tabu search method to optimize stand harvest and road construction schedules , 2000 .

[28]  Alan T. Murray.  Spatial restrictions in harvest scheduling , 1999 .

[29]  Ali Ridha Mahjoub,et al.  Compositions of Graphs and Polyhedra III: Graphs with No W4 Minor , 1994, SIAM J. Discret. Math..

[30]  Anthony Wren,et al.  Computer Scheduling of Public Transportation: Urban Passenger Vehicle and Crew Scheduling , 1981 .

[31]  Miguel Constantino,et al.  A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints , 2005, Eur. J. Oper. Res..

[32]  F. Barahona,et al.  A column generation algorithm for solving general forest planning problems with adjacency constraints , 1994 .

[33]  G. Nemhauser,et al.  Optimal Political Districting by Implicit Enumeration Techniques , 1970 .

[34]  Ali Ridha Mahjoub,et al.  Compositions of Graphs and Polyhedra II: Stable Sets , 1994, SIAM J. Discret. Math..

[35]  D. R. Fulkerson,et al.  Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

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

[37]  Alan T. Murray,et al.  Analyzing Cliques for Imposing Adjacency Restrictions in Forest Models , 1996, Forest Science.

[38]  Kevin Boston,et al.  Combining tabu search and genetic algorithm heuristic techniques to solve spatial harvest scheduling problems , 2002 .

[39]  Martin W. P. Savelsbergh,et al.  A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..

[40]  J. D. Brodie,et al.  Comparison of a random search algorithm and mixed integer programming for solving area-based forest plans. , 1990 .