Unifying reserve design strategies with graph theory and constraint programming - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Unifying reserve design strategies with graph theory and constraint programming

(1, 2) , (1, 2) , (3)
1
2
3

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.
Fichier principal
Vignette du fichier
paper-cp18.pdf (1.68 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01885111 , version 1 (08-11-2018)

Identifiers

Cite

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⟩
193 View
205 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More