Unifying reserve design strategies with graph theory and constraint programming

Abstract : The delineation of areas of high ecological or biodiversity value is a priority of any conservation program. However, the selection of optimal areas to be preserved necessarily results from a compromise between the complexity of ecological processes and managers’ constraints. Current reserve design models usually focus on few criteria, which often leads to an oversimplification of the underlying conservation issues. This paper shows that Constraint Programming (CP) can be the basis of a more unified, flexible and extensible framework. First, the reserve design problem is formalized. Secondly, the problem is modeled from two different angles by using two graph-based models. Then CP is used to aggregate those models through a unique Constraint Satisfaction Problem. Our model is finally evaluated on a real use case addressing the problem of rainforest fragmentation in New Caledonia, a biodiversity hotspot. Results are promising and highlight challenging perspectives to overtake in future work.
Document type :
Conference papers
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal-mines-albi.archives-ouvertes.fr/hal-01885111
Contributor : Imt Mines Albi Ecole Nationale Supérieure Des Mines d'Albi-Carmaux <>
Submitted on : Thursday, November 8, 2018 - 11:50:52 AM
Last modification on : Friday, March 29, 2019 - 9:10:41 AM
Long-term archiving on : Saturday, February 9, 2019 - 1:23:39 PM

File

paper-cp18.pdf
Files produced by the author(s)

Identifiers

Citation

Dimitri Justeau-Allaire, Philippe Birnbaum, Xavier Lorca. Unifying reserve design strategies with graph theory and constraint programming. CP 2018 - International conference on principles and practice of Constraint Programming, Aug 2018, Lille, France. p.507-523, ⟨10.1007/978-3-319-98334-9_33⟩. ⟨hal-01885111⟩

Share

Metrics

Record views

95

Files downloads

102