Location of Repository

Imposing Connectivity Constraints in Forest Harvest Scheduling

By Rodolfo Carvajal, Miguel Constantino, Marcos Goycoolea, Juan Pablo Vielma and Andrés Weintraub

Abstract

A major challenge in forest harvest scheduling is to balance economic gain with the preservation of wildlife habitat. One way of addressing preservation concerns in profit maximizing models consists in requiring that large contiguous patches of mature forest to be left standing after harvest. Another way of addressing such concerns in the context of nature reserve design is to select connected regions of forest in such a way as to maximize the number of species and habitats protected. While a number of integer programming formulations have been proposed for such forest planning problems, most are impractical in that they fail to solve reasonably sized scheduling instances. We present a new integer programmig methodology and test an implementation of it on four medium-sized forest instances publically available in the FMOS repository. Our approach allows us to obtain near-optimal solutions for multiple time-period instances in under four hours and to analyze spatial and cost properties of these solutions. Key words: integer programming; cutting plane; natural resources 1

Topics: Carvajal et al, Imposing Connectivity Constraints in Forest Harvest Scheduling
Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.180.7261
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www2.isye.gatech.edu/%7... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.