Using Dynamic Programming and Overlapping Subproblems to Address Adjacency in Large Harvest Scheduling Problems

$29.50 plus tax (Refund Policy)

Buy Article:


The adjacency problem for forest management scheduling is formulated as a dynamic programming problem. To overcome typical model-size problems, a solution strategy is proposed which links dynamic programming formulations for overlapping subproblems. Subproblems are solved sequentially in a moving-windows fashion. Solutions are near-optimal for three large but simplified test cases. Model size is sensitive to the size of the moving window. Using relatively small windows produced solutions that are closer to optimal than those found using two other modeling approaches. Solutions are also insensitive to the side of the forest used to start the moving-windows process, and microcomputer solution times are not a major consideration. The strategy offers potential to treat adjacency measures as valued management outputs. It will likely fit well into broader forestwide models which decompose the forestwide problem into parts to help address other forestwide constraints. For. Sci. 44(4):526-538.

Keywords: Forest management scheduling; adjacency constraints; forest edge; spatial modeling

Document Type: Journal Article

Affiliations: Assistant Professor, Departamento de Engenharia Florestal, Instituto Superior de Agronomia, Tapada da Ajuda, 1399 Lisboa Codex, Portugal

Publication date: November 1, 1998

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



Share Content

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