Robust Network Design For Multispecies Conservation

Robust Network Design For Multispecies Conservation
复制标题

用于多物种保护的稳健网络设计

DOI:
--
复制
发表时间:
2013
期刊:
AAAI Conference on Artificial Intelligence
影响因子:
--
通讯作者:
Claire A. Montgomery
Claire A. Montgomery
中科院分区:
--
文献类型:
--
作者:
Ronan Le Bras;B. Dilkina;Yexiang Xue;C. Gomes;K. McKelvey;M. Schwartz;Claire A. Montgomery

文献摘要

被引文献

相似文献

我们的工作是由一个重要的网络设计应用在野生动物保护的计算可持续性中所推动的。面对人类发展和气候变化,重要的是保护景观连通性的保护计划表现出一定程度的稳健性。虽然以前的工作集中在导致栖息地保护区网络相连的保护战略上,但拟议的解决方案的稳健性尚未被考虑到。为了解决这一重要方面,我们将该问题形式化为一个节点加权的双准则网络设计问题,该问题的连通性要求是节点对之间的不相交路径的数目。在大多数可生存网络设计工作中,目标是最小化所选网络的成本,而我们的目标是在满足连通性要求的同时,在指定预算内优化所选路径的质量。我们刻画了问题在不同约束下的复杂性。我们提供了一种混合整数规划编码,允许找到具有最优性保证的解,以及一种具有更好的缩放行为但没有保证的混合局部搜索方法。我们使用合成基准来评估我们的方法的典型案例性能,并将它们应用于关于美国落基山脉(蒙大拿州)狼獾和山猫种群保护的大规模真实世界网络设计问题。
Our work is motivated by an important network design application in computational sustainability concerning wildlife conservation. In the face of human development and climate change, it is important that conservation plans for protecting landscape connectivity exhibit certain level of robustness. While previous work has focused on conservation strategies that result in a connected network of habitat reserves, the robustness of the proposed solutions has not been taken into account. In order to address this important aspect, we formalize the problem as a node-weighted bi-criteria network design problem with connectivity requirements on the number of disjoint paths between pairs of nodes. While in most previous work on survivable network design the objective is to minimize the cost of the selected network, our goal is to optimize the quality of the selected paths within a specified budget, while meeting the connectivity requirements. We characterize the complexity of the problem under different restrictions. We provide a mixed-integer programming encoding that allows for finding solutions with optimality guarantees, as well as a hybrid local search method with better scaling behavior but no guarantees. We evaluate the typical-case performance of our approaches using a synthetic benchmark, and apply them to a large-scale real-world network design problem concerning the conservation of wolverine and lynx populations in the U.S. Rocky Mountains (Montana).