multiscape: Multi-Action, Multi-Objective Spatial Planning

Provides a modular framework for exact multi-objective spatial planning using mixed-integer programming. The package supports the definition of planning problems through planning units, features, management actions, action effects, spatial relations, targets, constraints, and objective functions. It enables the optimisation of spatial planning portfolios under considerations such as boundary structure, connectivity, and fragmentation. Supported multi-objective methods include weighted-sum aggregation, epsilon-constraint, and the augmented epsilon-constraint method. Problems can be solved with several commercial and open-source optimisation solvers. Optional solver backends include the 'gurobi' R package, which is distributed with the Gurobi Optimizer installation <https://docs.gurobi.com/projects/optimizer/en/13.0/reference/r/setup.html>, and the 'rcbc' R package, available from GitHub at <https://github.com/dirkschumacher/rcbc>. For background on multi-objective optimisation methods, see Halffmann et al. (2022) <doi:10.1002/mcda.1780>; for the augmented epsilon-constraint method, see Mavrotas (2009) <doi:10.1016/j.amc.2009.03.037>.

Package details

AuthorJosé Salgado-Rojas [aut, cre] (ORCID: <https://orcid.org/0000-0001-9817-2625>), Matías Moreno-Faguett [aut] (ORCID: <https://orcid.org/0009-0003-6561-234X>), Victoria Madrid-Ayala [aut] (ORCID: <https://orcid.org/0009-0008-5678-3418>), Sara Pineda-Zapata [aut] (ORCID: <https://orcid.org/0009-0006-8014-0098>), Núria Aquilué [aut] (ORCID: <https://orcid.org/0000-0001-7911-3144>)
MaintainerJosé Salgado-Rojas <jose.salgroj@gmail.com>
LicenseGPL (>= 3)
Version1.4.2
URL https://josesalgr.github.io/multiscape/ 
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:
install.packages("multiscape")

Try the multiscape package in your browser

Any scripts or data that you put into this service are public.

multiscape documentation built on Oct. 12, 2026, 5:08 p.m.