Accounting for habitat loss rates in sequential reserve selection : Simple methods for large problems

摘要: We develop reserve selection methods for maximizing either species retention in the landscape or representation areas. These are developed context of sequential selection, where site acquisition is done over a number years, yearly budgets limited and habitat loss may cause some sites to become unavailable during planning period. The main methodological development this study what we call site-ordering algorithm, which maximizes within selected at end period, while accounting rates optimization. Like stochastic dynamic programming, an approach that guarantees globally optimal solution, ordering algorithm generates sequence ideally acquired. As distinction from generated via relatively fast approximate process, involves hierarchic application principle maximization marginal gain. In our comparisons, emerges clear winner, it does well terms superior simple heuristics reserves. Unlike applicable large problem sizes, with reasonable computation times expected problems involving thousands sites.