Imposing Connectivity Constraints in Forest Planning Models

• 成果类型: Article
• 署名作者: Carvajal, Rodolfo; Constantino, Miguel; Goycoolea, Marcos; Vielma, Juan Pablo; Weintraub, Andres
• 署名单位: University System of Georgia; Georgia Institute of Technology; Universidad Adolfo Ibanez; Universidade de Lisboa; Massachusetts Institute of Technology (MIT); Pennsylvania Commonwealth System of Higher Education (PCSHE); University of Pittsburgh; Universidad de Chile
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.2013.1183
• 发表日期: 2013
• 页码: 824-836
• 关键词: harvest scheduling subject; collecting steiner problem; programming-model; old-growth; FRAGMENTATION; selection; restrictions; adjacency; criteria; areas

摘要

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.