Onal Hayri, Briers Robert A
Department of Agricultural and Consumer Economics, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA.
Proc Biol Sci. 2003 Jul 22;270(1523):1487-91. doi: 10.1098/rspb.2003.2393.
In the conservation literature, heuristic procedures have been employed to incorporate spatial considerations in reserve network selection with the presumption that computationally convenient optimization models would be too difficult or impossible to formulate. This paper extends the standard set-covering formulation to incorporate a particular spatial selection criterion, namely reducing the reserve boundary to the extent possible, when selecting a reserve network that represents a set of target species at least once. Applying the model to a dataset on the occurrence of breeding birds in Berkshire, UK, demonstrated that the technique resulted in significant reductions in reserve boundary length relative to solutions produced by the standard set-covering formulation. Computational results showed that moderately large reserve network selection problems could be solved without issue. Alternative solutions may be produced to explore trade-offs between boundary length, number of sites required or alternative criteria.
在保护文献中，启发式程序已被用于在保护区网络选择中纳入空间因素，前提是计算方便的优化模型制定起来过于困难或根本无法制定。本文扩展了标准的集合覆盖公式，以纳入一个特定的空间选择标准，即在选择一个至少代表一组目标物种一次的保护区网络时，尽可能减少保护区边界。将该模型应用于英国伯克郡繁殖鸟类出现情况的数据集，结果表明，与标准集合覆盖公式产生的解决方案相比，该技术显著减少了保护区边界长度。计算结果表明，中等规模的保护区网络选择问题可以顺利解决。可以生成替代解决方案，以探索边界长度、所需站点数量或替代标准之间的权衡。
