Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Mathematical methods for spatially cohesive reserve design|
|Citation:||Environmental Modeling & Assessment, 2002; 7(2 Special Issue SI):107-114|
|Publisher:||Kluwer Academic Publishers|
|Mark D. McDonnell, Hugh P. Possingham, Ian R. Ball and Elizabeth A. Cousins|
|Abstract:||The problem of designing spatially cohesive nature reserve systems that meet biodiversity objectives is formulated as a nonlinear integer programming problem. The multiobjective function minimises a combination of boundary length, area and failed representation of the biological attributes we are trying to conserve. The task is to reserve a subset of sites that best meet this objective. We use data on the distribution of habitats in the Northern Territory, Australia, to show how simulated annealing and a greedy heuristic algorithm can be used to generate good solutions to such large reserve design problems, and to compare the effectiveness of these methods.|
|Keywords:||reserve design; simulated annealing; set covering problem; spatial; clustering; fragmentation; optimisation heuristics; multiobjective optimisation|
|Description:||The original publication is availiable at www.springerlink.com|
|Appears in Collections:||Applied Mathematics publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.