A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation

We consider a problem of forest planning on pine plantations over a two to five year horizon. Basic decisions concern the areas to harvest in each period, the amount of timber to produce to satisfy aggregate demands for log exports, sawmills and pulp plants, and the roads to build for access and storage of timber. A linear programming model with 0--1 variables describes the decision process. Solution strategies involve strengthening of the model, lifting some of the constraints, and applying Lagrangean relaxation. Results on real planning problems show that even as these problems become more complex, the proposed solution strategies lead to very good solutions, reducing the residual gap for the most difficult data set from 162% to 1.6%, and for all data sets to 2.6% or less.

[1]  Andres Weintraub,et al.  A Forest Management Planning Model Integrating Silvicultural and Transportation Activities , 1976 .

[2]  Monique Guignard-Spielberg,et al.  Model tightening for integrated timber harvest and transportation planning , 1998, Eur. J. Oper. Res..

[3]  John Sessions,et al.  A New Heuristic To Solve Spatially Constrained Long-Term Harvest Scheduling Problems , 1994, Forest Science.

[4]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

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

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

[7]  Greg Jones,et al.  A Heuristic System to Solve Mixed Integér Forest Planning Models , 1994, Oper. Res..

[8]  Alan T. Murray,et al.  Measuring the efficacy of adjacency constraint structure in forest planning models , 1995 .

[9]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[10]  A. Weintraub,et al.  Heuristic procedures for solving mixed-integer harvest scheduling–transportation planning models , 1995 .

[11]  Thomas L. Magnanti,et al.  Modeling and Solving the Two-Facility Capacitated Network Loading Problem , 1995, Oper. Res..

[12]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

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

[14]  Oktay Günlük,et al.  Capacitated Network Design - Polyhedral Structure and Computation , 1996, INFORMS J. Comput..

[15]  David K. Smith Theory of Linear and Integer Programming , 1987 .