Article ID: | iaor20003545 |
Country: | Netherlands |
Volume: | 119 |
Issue: | 2 |
Start Page Number: | 427 |
End Page Number: | 439 |
Publication Date: | Dec 1999 |
Journal: | European Journal of Operational Research |
Authors: | Epstein Rafael, Weintraub Andres, Nieto E., Chevalier P., Gabarr J. |
Keywords: | programming: linear |
Short term harvesting requires decisions on which stands to harvest, what timber volume to cut, what bucking patterns (how to cut up the logs) to apply to logs in order to obtain products that satisfy demand and which harvesting machinery to use. This is an important problem in forest management and difficult to solve well in satisfying demand, while maximizing net profits. Traditionally, foresters have used manual approaches to find adequate solutions, which has shortcomings both in time spent by analysts and the quality of solutions. Since demand for timber products is defined by length, diameter and quality of each piece, this leads to a complex combinatorial problem in matching supply (standing trees) and demand. We developed one of the few reported approaches for solving the short term harvesting problem based on a computerized system, using a linear programming approach. Determining adequate bucking patterns is not trivial. We develop a column generation approach to generate such patterns. The subproblem is a specially designed branch and bound scheme. The generation of bucking patterns implemented within the LP formulation led to a significant improvement of solutions. We believe this is the first system implemented with this level of detail. This system has been advantageously implemented in several forest companies. The results obtained show improvements obtained by the firms of 5–8% in net revenues over traditional manual approaches.