Imposing Connectivity Constraints in Forest Planning Models
Name
Vielma_Imposing Connectivity Constraints.pdf
Size
811.08 KB
Format
Adobe PDF
Checksum (MD5)
fb224d8f8349431853c68d4e64b1aee5
Author(s)
Carvajal, Rodolfo
Constantino, Miguel
Goycoolea, Marcos
Vielma, Juan Pablo
Weintraub, Andres
Date Issued
July 2013
Journal
Operations Research
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Citation
Carvajal, Rodolfo, Miguel Constantino, Marcos Goycoolea, Juan Pablo Vielma, and Andres Weintraub. “Imposing Connectivity Constraints in Forest Planning Models.” Operations Research 61, no. 4 (August 2013): 824–836.
Version
Author's final manuscript
Abstract
Connectivity requirements are a common component of forest planning models, with important examples arising in wildlife habitat protection. In harvest scheduling models, one way of addressing preservation concerns consists of requiring that large contiguous patches of mature forest are maintained. In the context of nature reserve design, it is common practice to select a connected region of forest, as a reserve, in such a way as to maximize the number of species and habitats protected. Although a number of integer programming formulations have been proposed for these forest planning problems, most are impractical in that they fail to solve reasonably sized scheduling instances. We present a new integer programming methodology and test an implementation of it on five medium-sized forest instances publicly available in the Forest Management Optimization Site repository. Our approach allows us to obtain near-optimal solutions for multiple time-period instances in fewer than four hours.
MIT Department
Sloan School of Management
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1287/opre.2013.1183
