This work describes a method of optimizing individual tree stem bucking operations. The individual optimal cutting patterns were generated by means of two modules: 1) a heuristic algorithm which identifies the potential cuts (useful numbers) to be evaluated along the stem, and 2) a Dynamic Programming based-algorithm to determine the optimum combination of products to be obtained to maximize stem profit. An example is provided to illustrate the optimum cutting patterns for 25 individual stems. Optimal and conventional bucking patterns were compared. Residues were reduced from about 16% to 5% by means of the optimal bucking patterns.
Optimization; dynamic programming; heuristics; Pinus
