go-v.orgdoi

A spatial stochastic programming model for timber and core area management under risk of stand-replacing fire

Dung Tuan Nguyen, Wei, Yu, Bevers, Michael, Kling, Robert W. · Digital Collections of Colorado (Colorado State University) · 2007

  • DOI 10.25675/3.018317
  • Publisher Colorado State University
  • Type article
  • Issued 2007

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

Digital Collections of Colorado (Colorado State University) · Colorado State University · article · 2007

Abstract

Forest harvest scheduling has been modeled using deterministic and stochastic programming models. Past models seldom address explicit spatial forest management concerns under the influence of natural disturbances. In this research study, we employ multistage full recourse stochastic programming models to explore the challenges and advantages of building spatial optimization models that account for the influences of random stand-replacing fires. Our exploratory test models simultaneously consider timber harvest and mature forest core area objectives. Each model run reports first-period harvesting decisions for each stand based on a sample set of random fire.

We integrate multiple model runs to evaluate the persistence of period-one solutions under the influence of stochastic fires. Follow-up simulations were used to support multiple comparisons of different candidate forest management alternatives for the first time period. Test case results indicate that integrating the occurrence of stand-replacing fire into forest harvest scheduling models could improve the quality of long-term spatially explicit forest plans.

Open the resolved locator · 10.25675/3.018317

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-20 02:15 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
http://hdl.handle.net/10217/72372
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.