A comparison of dynamic programming and A in optimal forest stand management

• Published in: Forest science Vol. 42; no. 4; pp. 498 - 503
• Main Authors: Arthaud, G.J. (University of Georgia, Athens, GA.), Pelkki, M.H
• Format: Journal Article
• Language: English
• Published: Bethesda, MD Society of American Foresters 01-11-1996
• Subjects: AMENAGEMENT FORESTIER; Biological and medical sciences; BOSQUES; Dendrometry. Forest inventory; ECONOMIA; ECONOMIE; Forest management; Forest management. Stand types and stand dynamics. Silvicultural treatments. Tending of stands. Natural regeneration; Forestry; FORET; Fundamental and applied biological sciences. Psychology; METHODE D'OPTIMISATION; METODOS DE OPTIMIZACION; ORDENACION FORESTAL; Operations research; Methodology; Growth; Silviculture; Pinus taeda; Forest management; Modeling; Optimization; Softwood forest tree; Gymnospermae; Dynamic programming; Mathematical model; A-asterisk; Method study; Forest stand; Forest mensuration; Forest production; Search algorithm; Applied mathematics; Wood line; Forest planning; Forest economics; Coniferales; Spermatophyta; Heuristic approach; Comparative study
• ISSN: 0015-749X; 1938-3738
• DOI: 10.1093/forestscience/42.4.498

A model that adds a forward value estimator to traditional forward recursion dynamic programming (DP) is developed. State classes are used to store continuous values for stand basal area and stem density. A simple forward heuristic that estimates future value from deviations within a node is used in the model in combination with accumulated value to determine path choice (A*). A loblolly pine growth and yield model with both pulpwood and sawtimber product outputs is used in the model. The model is tested on combinations of initial planting density, site index, and interest rates to compare A* to DP in optimization of thinning age, thinning intensity, and rotation age. Results from tests using single-year stage intervals show increases of 0.0% to 1.2% in net present value for A* compared to DP. An A* approach increases computer program size very little but requires additional time for parameter searching. However, A* always generated solutions at least as high as DP