raptr: raptr: Representative and Adequate Prioritization Toolkit in...

raptrR Documentation

raptr: Representative and Adequate Prioritization Toolkit in R

Description

Biodiversity is in crisis. The overarching aim of conservation is to preserve biodiversity patterns and processes. To this end, protected areas are established to buffer species and preserve biodiversity processes. But resources are limited and so protected areas must be cost-effective. This package contains tools to generate plans for protected areas (prioritizations). Conservation planning data are used to construct an optimization problem, which is then solved to yield prioritizations. To solve the optimization problems in a feasible amount of time, this package uses the commercial 'Gurobi' software package (obtained from https://www.gurobi.com/). For more information on using this package, see Hanson et al. (2018).

Details

The main classes used in this package are used to store input data and prioritizations:

GurobiOpts

parameters for solving optimization problems using Gurobi.

RapReliableOpts

parameters for the reliable formulation of RAP.

RapUnreliableOpts

parameters for the unreliable formulation of RAP.

RapData

planning unit, species data, and demand points for RAP.

RapUnsolved

contains all the data and input parameters required to generate prioritizations using RAP. This class contains a GurobiOpts object, a RapReliableOpts or RapUnreliableOpts object, and a RapData object.

RapResults

prioritizations and summary statistics on their performance.

RapSolved

contains all the input data, parameters and output data. This class contains all the objects in a RapUnsolved() object and also a RapResults object.

Type vignette("raptr") for a tutorial on how to use this package.

References

Hanson JO, Rhodes JR, Possingham HP & Fuller RA (2018) raptr: Representative and Adequate Prioritization", Toolkit in R. Methods in Ecology & Evolution,", 9: 320–330. DOI: 10.1111/2041-210X.12862.


raptr documentation built on March 31, 2023, 9:46 p.m.