Imposing Connectivity Constraints in Forest Planning Models

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.

[1]  Jill Bowling,et al.  Integrating Forest Protection, Management and Restoration at a Landscape Scale , 2004 .

[2]  Francisco Barahona,et al.  Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches , 2005, Oper. Res..

[3]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[4]  Marc E. McDill,et al.  Harvest Scheduling with Area-Based Adjacency Constraints , 2002, Forest Science.

[5]  Marc E. McDill,et al.  Promoting Large, Compact Mature Forest Patches in Harvest Scheduling Models , 2008 .

[6]  Hayri Önal,et al.  Optimal Selection of a Connected Reserve Network , 2006, Oper. Res..

[7]  Paolo Toth,et al.  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010. Proceedings , 2010, CPAIOR.

[8]  John Sessions,et al.  Solving for Habitat Connections as a Steiner Network Problem , 1992 .

[9]  J A Heesterbeek,et al.  On optimal size and number of reserves for metapopulation persistence. , 2000, Journal of theoretical biology.

[10]  Karin Öhman,et al.  Incorporating aspects of habitat fragmentation into long-term forest planning using mixed integer programming , 2008 .

[11]  Marc E. McDill,et al.  Finding the Efficient Frontier of a Bi-Criteria, Spatially Explicit, Harvest Scheduling Problem , 2006, Forest Science.

[12]  Karin Öhman,et al.  Creating continuous areas of old forest in long- term forest planning , 2000 .

[13]  Alexandre Salles da Cunha,et al.  A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs , 2009, Discret. Appl. Math..

[14]  Bistra N. Dilkina,et al.  Solving Connected Subgraph Problems in Wildlife Conservation , 2010, CPAIOR.

[15]  Jamie B. Kirkpatrick,et al.  An iterative method for establishing priorities for the selection of nature reserves: An example from Tasmania , 1983 .

[16]  Justin C. Williams.  A Zero-One Programming Model for Contiguous Land Acquisition , 2002 .

[17]  P. Ciais,et al.  Old-growth forests as global carbon sinks , 2008, Nature.

[18]  Juan Pablo Vielma,et al.  Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems , 2007, Eur. J. Oper. Res..

[19]  Bernard G. Halterman,et al.  Integrating timber and wildlife management planning , 1973 .

[20]  Marc E. McDill,et al.  Can mature patch constraints mitigate the fragmenting effects of harvest opening size restrictions , 2003 .

[21]  Miguel Constantino,et al.  A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions , 2008, Oper. Res..

[22]  Marc E. McDill,et al.  A mixed-integer formulation of the minimum patch size problem , 2003 .

[23]  Karin Öhman,et al.  Reducing forest fragmentation in long-term forest planning by using the shape index , 2005 .

[24]  Abdel Lisser,et al.  Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems , 2003 .

[25]  J. Orestes Cerdeira,et al.  Connectivity in priority area selection for conservation , 2005 .

[26]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[27]  Charles ReVelle,et al.  Central Facilities Location , 2010 .

[28]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[29]  D. Earn,et al.  Coherence and conservation. , 2000, Science.

[30]  Juan Pablo Vielma,et al.  Evaluating approaches for solving the area restriction model in harvest scheduling. , 2009 .

[31]  T. Crow,et al.  Simulating Spatial and Temporal Context of Forest Management Using Hypothetical Landscapes , 1998, Environmental management.

[32]  Peter Eades,et al.  On Optimal Trees , 1981, J. Algorithms.

[33]  Justin C. Williams,et al.  Reserve assemblage of critical areas: A zero-one programming approach , 1998 .

[34]  Takeshi Shirabe,et al.  A Model of Contiguity for Spatial Unit Allocation , 2005 .

[35]  David B. Lindenmayer,et al.  Re-evaluation of forest biomass carbon stocks and lessons from the world's most carbon-dense forests , 2009, Proceedings of the National Academy of Sciences.

[36]  Sándor F. Tóth,et al.  Modeling Timber and Non-timber Trade-offs in Spatially-explicit Forest Planning , 2005 .

[37]  Roberto Cordone,et al.  An exact algorithm for the node weighted Steiner tree problem , 2006, 4OR.

[38]  Mauricio G. C. Resende,et al.  Strong lower bounds for the prize collecting Steiner problem in graphs , 2004, Discret. Appl. Math..

[39]  Miguel Constantino,et al.  A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints , 2005, Eur. J. Oper. Res..

[40]  G. Nemhauser,et al.  Optimal Political Districting by Implicit Enumeration Techniques , 1970 .

[41]  Matteo Fischetti,et al.  An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem , 2006, Math. Program..

[42]  Justin C. Williams,et al.  Delineating protected wildlife corridors with multi‐objective programming , 1998 .

[43]  Alan T. Murray.  Spatial restrictions in harvest scheduling , 1999 .

[44]  Arie Segev,et al.  The node-weighted steiner tree problem , 1987, Networks.

[45]  Hayri Önal,et al.  Incorporating spatial criteria in optimum reserve network selection , 2002, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[46]  Hayri Önal,et al.  Selection of a minimum–boundary reserve network using integer programming , 2003, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[47]  Armin Fügenschuh,et al.  Integer linear programming models for topology optimization in sheet metal design , 2008, Math. Methods Oper. Res..

[48]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[49]  Charles S. ReVelle,et al.  Spatial attributes and reserve design models: A review , 2005 .

[50]  L. Wolsey,et al.  Chapter 9 Optimal trees , 1995 .

[51]  Felipe Caro,et al.  A 2-Opt Tabu Search Procedure for the Multiperiod Forest Harvesting Problem with Adjacency, Greenup, Old Growth, and Even Flow Constraints , 2003, Forest Science.

[52]  J. K. Gilless,et al.  Economic and fragmentation effects of clearcut restrictions , 1998 .

[53]  R. Kipp Martin,et al.  Using separation algorithms to generate mixed integer model reformulations , 1991, Oper. Res. Lett..