作者: Ronan Le Bras , Michael K. Schwartz , Carla P. Gomes , Kevin S. McKelvey , Yexiang Xue
DOI:
关键词: Management science 、 Wildlife conservation 、 Landscape connectivity 、 Network planning and design 、 Mathematical optimization 、 Computer science 、 Robustness (computer science) 、 Disjoint sets
摘要: 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 that conservation plans for protecting landscape connectivity exhibit certain level robustness. While previous has focused on strategies result a connected habitat reserves, robustness proposed solutions not been taken into account. order to address this aspect, we formalize problem as node-weighted bi-criteria with requirements number disjoint paths between pairs nodes. most survivable objective minimize cost selected network, our goal optimize quality within specified budget, while meeting requirements. We characterize complexity under different restrictions. provide mixed-integer programming encoding allows finding optimality guarantees, well hybrid local search method better scaling behavior but no guarantees. evaluate typical-case performance approaches using synthetic benchmark, apply them large-scale real-world wolverine lynx populations U.S. Rocky Mountains (Montana).