Study on reserve site selection by simulated annealing algorithm: An example from the Great Blue Mountain World Heritage Area
-
摘要: 保护区选址要回答的问题是：如何在满足特定目标的前提下找出费用最小的空间布局.为解决这个问题,较多的是使用计算机摸拟退火算法.本研究以澳大利亚蓝山保护区为例，采用桃金娘科树种的空间分布数据，对蓝山保护区100 km的缓冲区范围进行了选址规划.为了强调规划中紧凑布局的重要性，本文基于模拟退火算法中的目标函数，比较了边界长度修正器（BLM）取不同值的运行结果.结果显示，紧凑布局通常需要较大的面积，但是保护区的边界长度较短，因此有利于维护和管理.Abstract: The reserve siteselection problem is how to minimize the cost of the reserve system while satisfying certain conservation goals. To solve this problem, simulated annealing algorithm is widely used. Take the Great Blue Mountain World Heritage Area (GBMWHA) as an example, this paper studied the distribution of myrtacea in the 100 kilometers buffer area of GBMWHA. The aim is focused on the compactness of the reserve system. We experimented variety parameters of the objective function，namely the boundary length modifier (BLM). The results show that, a more compact portfolio could be achieved at the expense of larger area. But the compact system has shorter boundary, thus is easier to manage.
-
点击查看大图
计量
- 文章访问数: 2669
- HTML全文浏览量: 9
- PDF下载量: 1907
- 被引次数: 0
下载: