Figure - uploaded by Catherine Geoffroy
Content may be subject to copyright.
Fig. A1.8 Density curves showing the distribution of values for the time of capture relative to sunrise for individuals translocated over 500 m in 3 cover types (partiallyharvested, deciduous forest with 5-m wide cut strips; untreated mature deciduous forest; ~40-year-old spruce plantation). The dashed lines represent the mean speed value for each category.
Source publication
Conservation efforts addressing the impacts of habitat loss and fragmentation on movements must rely on operational definitions of land-cover types that are relevant to the behavioral decisions made by the species of interest. Travel costs, and ultimately landscape resistance (or permeability to movement) can be assessed through experiments standar...
Citations
Establishing wildlife corridors to link detached habitat patches is a widely advocated conservation strategy to reduce the adverse impacts of habitat fragmentation. Given the scarcity of conservation resources, designing an efficient corridor system calls for an optimization approach. The optimal configuration of a wildlife corridor system involving multiple habitat patches poses significant challenges, both methodologically and computationally. This study proposes a two-stage procedure for that purpose. In the first stage, we determine a best-quality corridor between each pair of habitat patches using the method described in Wang et al. (2022). In the second stage, we select a subset of those corridors to assemble a least-cost corridor system using a mixed integer linear programming model presented in this paper. We use an illustrative example to demonstrate the workings of the two-stage method, and then apply it to a real dataset for an area in Cumberland County, Nova Scotia, Canada, involving 1039 irregular land parcels. Results show that an efficient corridor system where each habitat patch is connected to some neighboring habitat patches through a specified minimum number of corridors can be identified conveniently in terms of both data processing and computational effort.
