Scheduling Conservation Designs for Maximum Flexibility via Network Cascade Optimization Public Deposited

http://ir.library.oregonstate.edu/concern/articles/jq085m868

This is the publisher’s final pdf. The published article is copyrighted by the AI Access Foundation and can be found at:  http://www.jair.org/.

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • One approach to conserving endangered species is to purchase and protect a set of land parcels in a way that maximizes the expected future population spread. Unfortunately, an ideal set of parcels may have a cost that is beyond the immediate budget constraints and must thus be purchased incrementally. This raises the challenge of deciding how to schedule the parcel purchases in a way that maximizes the flexibility of budget usage while keeping population spread loss in control. In this paper, we introduce a formulation of this scheduling problem that does not rely on knowing the future budgets of an organization. In particular, we consider scheduling purchases in a way that achieves a population spread no less than desired but delays purchases as long as possible. Such schedules offer conservation planners maximum flexibility and use available budgets in the most efficient way. We develop the problem formally as a stochastic optimization problem over a network cascade model describing a commonly used model of population spread. Our solution approach is based on reducing the stochastic problem to a novel variant of the directed Steiner tree problem, which we call the set-weighted directed Steiner graph problem. We show that this problem is computationally hard, motivating the development of a primal-dual algorithm for the problem that computes both a feasible solution and a bound on the quality of an optimal solution. We evaluate the approach on both real and synthetic conservation data with a standard population spread model. The algorithm is shown to produce near optimal results and is much more scalable than more generic off-the-shelf optimizers. Finally, we evaluate a variant of the algorithm to explore the trade-offs between budget savings and population growth.
Resource Type
DOI
Date Available
Date Issued
Citation
  • Xue, S., Fern, A., & Sheldon, D. (2015). Scheduling Conservation Designs for Maximum Flexibility via Network Cascade Optimization. Journal of Artificial Intelligence Research, 52, 331-360. doi:10.1613/jair.4679
Series
Rights Statement
Funding Statement (additional comments about funding)
Publisher
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Submitted by Erin Clark (erin.clark@oregonstate.edu) on 2015-04-16T16:35:47Z No. of bitstreams: 1 XueShanEECSSchedulingConservationDesigns.pdf: 1144950 bytes, checksum: 36d1d7df5862e18e3a9cfb56bc757bab (MD5)
  • description.provenance : Made available in DSpace on 2015-04-16T16:36:00Z (GMT). No. of bitstreams: 1 XueShanEECSSchedulingConservationDesigns.pdf: 1144950 bytes, checksum: 36d1d7df5862e18e3a9cfb56bc757bab (MD5) Previous issue date: 2015
  • description.provenance : Approved for entry into archive by Erin Clark(erin.clark@oregonstate.edu) on 2015-04-16T16:36:00Z (GMT) No. of bitstreams: 1 XueShanEECSSchedulingConservationDesigns.pdf: 1144950 bytes, checksum: 36d1d7df5862e18e3a9cfb56bc757bab (MD5)

Relationships

In Administrative Set:
Last modified: 07/27/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items