Skip to main content

A Comparison of the Pattern Search Algorithm and the Modified PATH Algorithm for Optimizing an Individual Tree Model

Buy Article:

$29.50 plus tax (Refund Policy)


A new stand-level dynamic programming algorithm was developed for determining the optimal residual diameter distribution for multiple stand entries. The proposed algorithm consists of the PATH algorithm and the concept of region-limiting strategies and iterated dynamic programming. Employing the proposed algorithm, a dynamic programming model was constructed with the Stand Prognosis Model, a single-tree/distance-independent growth model for forest types in the northern Rocky Mountains. Convergence, accuracy, and efficiency of the algorithm are discussed in comparison with a nonlinear programming algorithm, the Hooke and Jeeves method. For problems with three or more thinnings, the proposed algorithm yielded superior solutions with less computation time than did the Hooke and Jeeves method. For one and two thinning problems, the Hooke and Jeeves method provided better solutions. The advantage of the proposed algorithm stems from the ability of dynamic programming approaches to avoid including multiple partial local optima in the solution, and a clearer relationship to established principles of concave optimization. For. Sci. 36(2):394-412.

Keywords: Operations research; dynamic programming; forest economics

Document Type: Journal Article

Affiliations: Professor, Department of Forest Resources, Oregon State University, Corvallis, OR 97331

Publication date: June 1, 1990

More about this publication?
  • Membership Information
  • ingentaconnect is not responsible for the content or availability of external websites

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more