add_contiguity_constraintsfunction now uses sparse matrix formats internally for single-zone problems. This means that the constraints can be applied to single-zoned problem with many more planning units.
add_connectivity_penaltiesfunction now uses sparse matrix formats internally for single-zone problems. This means that connectivity penalties can be applied to single-zoned problem with many more planning units.
add_locked_out_constraintsthat incorrectly threw an error when using
logicallocked data (i.e.
FALSE) because it incorrectly thought that valid inputs were invalid.
add_manual_locked_constraintswhere solving the same problem object twice resulted in incorrect planning units being locked in or out of the solution (#92).
feature_abundancesthat caused the solve function to throw an error when attempting to solve problems with a single feature.
add_cuts_portfoliothat caused the portfolio to return solutions that were not within the specified optimality gap when using the Gurobi solver.
feature_representationfunction now allows
numericsolutions with attributes (e.g. when output by the
solvefunction) when calculating representation statistics for problems with
numericplanning unit data (#91).
add_manual_targetsfunction threw a warning when some features had targets equal to zero. This resulted in an excessive amount of warnings. Now, warnings are thrown for targets that are less then zero.
problemfunction sometimes incorrectly threw a warning that feature data had negative values when the data actually did not contain negative values. This has now been addressed.
problemfunction now allows negative values in the cost and feature data (and throws a warning if such data are detected).
add_manual_targetsfunctions now allow negative targets (but throw a warning if such targets are specified).
compilefunction throws an error if a problem is compiled using the expanded formulation with negative feature data.
add_absolute_targetsfunction now throws an warning—instead of an error—if the specified targets are greater than the feature abundances in planning units to accommodate negative values in feature data.
add_max_cover_objectivein prioritizr vignette (#90).
add_relative_targetsdocumentation now makes it clear that locked out planning units are included in the calculations for setting targets (#89).
add_loglinear_targetsfunction now includes a
feature_abundancesparameter for specifying the total amount of each feature to use when calculating the targets (#89).
feature_abundancesfunction to calculate the total amount of each feature in the planning units (#86).
add_cuts_portfoliofunction uses the Gurobi solution pool to generate unique solutions within a specified gap of optimality when tasked with solving problems with Gurobi (version 8.0.0+; #80).
add_pool_portfoliofunction to generate a portfolio of solutions using the Gurobi solution pool (#77).
boundary_matrixfunction now has the experimental functionality to use GEOS STR trees to speed up processing (#74).
feature_representationfunction to how well features are represented in solutions (#73).
solvefunction printing superfluous text (#75).
sim_features_zonesfor exploring conservation problems with multiple management zones.
Zonesclass to organize data with multiple zones.
problemfunction now accepts
Zoneobjects as arguments for
featureto create problems with multiple zones.
add_absolute_targetsfunctions for adding targets to problems can be used to specify targets for each feature in each zone.
add_manual_targetsfunction for creating targets that pertain to multiple management zones.
solvefunction now returns a
listof solutions when generating a portfolio of solutions.
add_locked_out_constraintsfunctions for specifying which planning units are locked in or out now accept
matrixarguments for specifying which zones are locked in or out.
add_manual_locked_constraintsfunction to manually specify which planning units should or shouldn’t be allocated to specific zones in solutions.
zonesparameter) and specify how they they should be applied (using the
dataparameter. All of these functions have default arguments that mean that problems with a single zone should have the same optimal solution as problems created in the earlier version of the package.
add_feature_weightsfunction can be used to weight different the representation of each feature in each zone.
category_vectorfunctions have been provided to help work with data for multiple management zones.
?prioritizr), and README.
marxan_problemhas been updated with more comprehensive documentation and to provide more helpful error messages. For clarity, it will now only work with tabular data in the standard Marxan format.
add_locked_out_constraintsthrow an exception when used with semi-continuous-type decisions (#59).
compilethrown when the same planning unit is locked in and locked out now prints the planning unit indices in a readable format.
add_locked_out_constraintsare ignored when using proportion-type decisions (#58).
predefined_optimization_problemwhich incorrectly recognized some inputs as invalid when they were in fact valid.
R CMD checkrelated to proto in Depends.
add_lpsymphony_solvernow throws warnings to alert users to potentially incorrect solutions (partially addressing #40).
add_max_cover_objectivefunction has been renamed to the
add_max_utility_objective, because the formulation does not follow the historical formulation of the maximum coverage reserve selection problem (#38).
add_max_cover_objectivefunction now follows the historical maximum coverage objective. This fundamentally changes
add_max_cover_objectivefunction and breaks compatibility with previous version of prioritizr (#38).
add_lpsymphony_solvercausing error when attempting to solve problems.
numericvector data that caused an error.
numericvector input with rij data containing NA values.
add_connectivity_penaltiescausing the function to throw an error when the number of boundaries/edges is less than the number of planning units.
ArrayParameterprototypes to check t that functions for generating widgets have their dependencies installed.
numericplanning unit data and portfolios that caused the
solveto throw an error.
marxan_problemwould always use the first column in the attribute table for the cost data. This bug is serious so analysis that used
marxan_problemshould be rerun.
Spatial*DataFrameobjects are now stored in columns named “solution_*" (e.g. “solution_1”) to store multiple solutions.
verboseargument to all solvers. This replaces the
ConservationProblem$print()now only prints the first three species names and a count of the total number of features. This update means that
ConservationProblemobjects with lots of features can now safely be printed without polluting the R console.
devtools::build_vignettes(). Earlier versions needed the vignettes to be compiled using the Makefile to copy files around to avoid tangled R code causing failures during R CMD CHECK. Although no longer needed, the vignettes can still be compiled using the shell command
make vignsif desired.
rmarkdown::render("README.Rmd")or using the shell command
make readme. Note that the figures for
README.mdcan be found in the directory
prshinywill now only be run if executed during an interactive R session. Prior to this R CMD CHECK would hang.
problem.data.framethat meant that it did not check for missing values in
add_absolute_targetsand add_relative_targets` related to their standardGeneric being incorrectly defined
list. The elements in the list are assumed to be
dsCMatrixobjects (aka symmetric sparse matrices in a compressed format) and are coerced to
dgCMatrixobjects to reduce computational burden. There was a typo, however, and so the objects were coerced to
dgCMatrix. This evidently was ok in earlier versions of the RcppArmadillo and/or Matrix packages but not in the most recent versions.
NAon some systems preventing users from using the Gurobi solver–even when one thread is specified.
add_default_solverto own help file
add_corridor_constraintsthat fails to actually add the constraints with argument to
connectivityis a list.
make installcommand so that it now actually installs the package.